Mathematical Model of Scheduler with Semi-Markov Input and Bandwidth Sharing Discipline
- 14 July 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 494-498
Abstract
In this paper, we consider single server queueing system with multiple semi-Markov inputs and buffers. Each request of the flows brings to the system some random amount of information. According to the bandwidth sharing discipline, each buffer has its own part of the throughput and the server transmits the information from buffers simultaneously. The aim of the current research is to derive the probability distribution of the amount of information in single buffer.Keywords
This publication has 6 references indexed in Scilit:
- Adaptive Cyclic Polling Systems: Analysis and Application to the Broadband Wireless NetworksLecture Notes in Computer Science, 2019
- New Polling Scheme based on Busy/Idle Queues Mechanism2018
- A novel framework for G/M/1 queuing system based on scheduling-cum-polling mechanism to analyze multiple classes of self-similar and LRD trafficWireless Networks, 2015
- Analytical modeling of an integrated priority and WFQ scheduling scheme in multi-service networksComputer Communications, 2010
- Mean Delay Analysis of Multi Level Processor Sharing Disciplines2006
- Bandwidth allocation in wireless networks with guaranteed packet-loss performanceIEEE/ACM Transactions on Networking, 2000