Tetsuji Hirayama
ABSTRACT
In this paper, we investigate mean sojourn times in multiclass queues with feedback and their application to packet scheduling in communication networks.
We first analyze the feedback queues with J groups of customers and a single server. The server selects a group (station) in a priority order and admits its customers into the service facility according to one of the following rules: 1-limited, gated, or exhaustive. Since there are multiple classes of customers in each group, they are served in either the (local) priority order or the first-come-first-served order. We derive the mean sojourn times for all service stages of customers circulating the system.
Then we consider their application to a packet scheduling problem in communication networks where a mission-critical traffic is given some preferential treatment over the other normal traffic. Packets belonging to the normal traffic are allocated the resource capacity in proportion to their assigned weights in a round-robin manner, which we call the "discriminatory round robin (DRR)." We construct some composite scheduling algorithms and compare their performance.
- S. Aalto, U. Ayesta, S. Borst, V. Misra, and R. Núñez-Queija. Beyond processor sharing. ACM SIGMETRICS Performance Evaluation Review, 34(4):36--43, 2007. Google Scholar
Digital Library
- E. Altman, K. Avrachenkov, and U. Ayesta. A survey on discriminatory processor sharing. Queueing Systems, 53:53--63, 2006. Google ScholarDigital Library
- J. L. van den Berg, O. J. Boxma, and W. P. Groenendijk. Sojourn times in the M/G/1 queue with deterministic feedback. Commun. Statist.-Stochastic Models, 5:115--129, 1989.Google ScholarCross Ref
- B. D. Choi, B. Kim, and S. H. Choi. On the M/G/1 Bernoulli feedback queue with multi-class customers. Computers&Operations Research, 27:269--286, 2000. Google ScholarDigital Library
- Cisco Systems. Cisco IOS Quality of Service Solutions Configuration Guide, Release 12.4T. Cisco Systems, 2008.Google Scholar
- G. Fayolle, I. Mitrani, and R. Iasnogorodski. Sharing a processor among many job classes. Journal of the ACM, 27(3):519--532, 1980. Google ScholarDigital Library
- T. Hirayama. Mean sojourn times in multiclass feedback queues with gated disciplines. Naval Research Logistics, 50:719--741, 2003.Google ScholarCross Ref
- T. Hirayama. Multiclass polling systems with Markovian feedback: Mean sojourn times in gated and exhaustive systems with local priority and FCFS service orders. Journal of the Operations Research Soc. of Japan, 48:226--255, 2005.Google ScholarCross Ref
- L. Kleinrock. Queueing Systems Volume II: Computer Applications. Wiley, 1976.Google Scholar
- M. Nuyens and A. Wierman. The foreground-background queue: A survey. Performance Evaluation, 65:286--307, 2008. Google ScholarDigital Library
- M. Paterok, O. Fischer, and L. Opta. Feedback queues with preemption-distance priorities. Performance Evaluation Review, 17:136--145, 1989. Google ScholarDigital Library
- M. Sidi, H. Levy, and S. W. Fuhrmann. A queueing network with a single cyclically roving server. Queueing Systems, 11:121--144, 1992. Google ScholarDigital Library
- B. Simon. Priority queues with feedback. Journal of the ACM, 31(1):134--149, 1984. Google ScholarDigital Library
- S. Vegesna. IP Quality of Service. Cisco Press, 2001. Google ScholarDigital Library
Index Terms
- Analysis of multiclass feedback queues and its application to a packet scheduling problem
Recommendations
Population effects in multiclass processor sharing queues
VALUETOOLS '09: Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and ToolsConsider a single server queueing system with several classes of customers, each having its own renewal input process and its own general service times distribution. Upon completing service, customers may leave, or reenter the queue, possibly as ...
Multiclass Energy Packet Networks with finite capacity energy queues
AbstractEnergy Packet Network (EPN) consists of a queueing network formed by N blocks, where each of them is formed by one data queue, that handles the workload, and one energy queue, that handles packets of energy.
We study an EPN ...
Large Fluctuations in a Deterministic Multiclass Network of Queues
In this paper we investigate a relatively simple deterministic four-class two-queue multiclass open network of single-server FIFO queues with traffic intensity one at each queue. Our purpose is to better understand the effect of feedback with class-...
Comments