Time and space priority in a partially shared priority queue
Pages 125 - 131
Abstract
This paper studies a finite-sized discrete-time priority queue. Arriving packets can be classified into two types: delay-sensitive (class-1) packets and loss-sensitive (class-2) packets. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. Packets of class 1 have absolute transmission priority over class-2 packets whereas the latter receive space priority as the partial buffer sharing acceptance policy is used. The concurrent use of time and space priority, each for different packets, raises some issues on the order of arrivals in a slot. This is resolved by adopting a string representation for sequences of arriving packets and by defining a probability measure on the set of such strings. Performance of this queueing system is then determined using matrix-analytic techniques. Finally, the impact of various system parameters is demonstrated in several numerical examples.
References
[1]
C. Blondia and O. Casals. Statistical multiplexing of VBR sources: A matrix-analytic approach. Performance Evaluation, 16:5--20, 1992.
[2]
T. Demoor, J. Walraevens, D. Fiems, S. De Vuyst, and H. Bruneel. Modelling queue sizes in an expedited forwarding diffserv router with service differentiation. In QTNA '09: Proceedings of the 4th International Conference on Queueing Theory and Network Applications, pages 1--8, New York, NY, USA, 2009. ACM.
[3]
D. Fiems and H. Bruneel. A note on the discretization of Little's result. Operations Research Letters, 30(1):17--18, 2002.
[4]
D. Fiems, J. Walraevens, and H. Bruneel. Performance of a partially shared priority buffer with correlated arrivals. In Proceedings of the 20th International Teletraffic Congres (ITC 20). Lecture Notes in Computer Science 4516, pages 582--593, Ottawa, Canada, June 2007.
[5]
G. Hwang and B. Choi. Performance analysis of the DAR(1)/D/c priority queue under partial buffer sharing policy. Computers & Operations Research, 31(13):2231--2247, NOV 2004.
[6]
H. Kröner, G. Hébuterne, P. Boyer, and A. Gravey. Priority management in ATM switching nodes. IEEE Journal on Selected Areas in Communications, 9(3):418--427, 1991.
[7]
K. Laevens and H. Bruneel. Discrete-time multiserver queues with priorities. Performance Evaluation, 33(4):249--275, 1998.
[8]
G. Latouche and V. Ramaswami. Introduction to matrix analytic methods in stochastic modeling. Series on statistics and applied probability. ASA-SIAM, 1999.
[9]
M. Mehmet Ali and X. Song. A performance analysis of a discrete-time priority queueing system with correlated arrivals. Performance Evaluation, 57(3):307--339, 2004.
[10]
K. Spaey. Superposition of Markovian traffic sources and frame aware buffer acceptance. PhD thesis, Universitaire Instelling Antwerpen, 2002.
[11]
T. Takine, B. Sengupta, and T. Hasegawa. An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes. IEEE Transactions on Communications, 42(2--4):1837--1845, 1994.
[12]
J. Van Velthoven, B. Van Houdt, and C. Blondia. The impact of buffer finiteness on the loss rate in a priority queueing system. Lecture Notes in Computer Science, 4054:211--225, 2006.
[13]
J. Walraevens, B. Steyaert, and H. Bruneel. Performance analysis of a single-server ATM queue with a priority scheduling. Computers & Operations Research, 30(12):1807--1829, 2003.
[14]
J. Walraevens, S. Wittevrongel, and H. Bruneel. Performance analysis of a priority buffer with train arrivals. In, Proceedings of the 2006 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2006), Simulation Series 38(3), pages 586--594, Calgary, July 2006.
[15]
J. Walraevens, S. Wittevrongel, and H. Bruneel. A discrete-time priority queue with train arrivals. STOCHASTIC MODELS, 23(3):489--512, 2007.
[16]
Y. Wang, C. Liu, and C. Lu. Loss behavior in space priority queue with batch Markovian arrival process - discrete-time case. Performance Evaluation, 41(4):269--293, AUG 2000.
[17]
Y. C. Wang, J. S. Wang, and F. H. Tsai. Analysis of Discrete-Time Space Priority Queue with Fuzzy Threshold. Journal of Industrial and Management Optimization, 5(3, Sp. Iss. SI):467--479, AUG 2009. 3rd Asia-Pacific Symposium on Queueing Theory and Network Applications, Taipei, TAIWAN, JUL 30--AUG 02, 2008.
[18]
J. Zhao, B. Li, X. Cao, and I. Ahmad. A matrix-analytic solution for the DBMAP/PH/1 priority queue. Queueing Systems, 53(3):127--145, 2006.
Index Terms
- Time and space priority in a partially shared priority queue
Recommendations
Performance of a partially shared priority buffer with correlated arrivals
ITC20'07: Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networksIn this paper, we analyse a finite sized discrete time priority buffer with two types of packet arrivals, referred to as class 1 and class 2 packets. Packets of both classes arrive according to a discrete batch Markovian arrival process, taking into ...
A generalized non-preemptive priority queue
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1In this paper, we analyze a generalized non-preemptive queue with two priority classes. When the server serves the low priority queue, up to l customers are served before the server returns to the high priority queue. We study the embedded Markov chain ...
Priority tandem queueing model with admission control
A two-stage multi-server tandem queue with two types of processed customers is analyzed. The input is described by the Marked Markovian Arrival Process (MMAP). The first stage has an infinite number of servers while the second stage has a finite number ...
Comments
Information & Contributors
Information
Published In
Copyright © 2010 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- Beijing Jiaotong University
- Operations Research Society of China
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 July 2010
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QTNA '10
Sponsor:
QTNA '10: International Conference on Queueing Theory and Network Applications
July 24 - 26, 2010
Beijing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 62Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in