Abstract
In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. Performance measures of system contents and packet delay are calculated. We apply these theoretical results on the special case of a packet switch.
Similar content being viewed by others
References
H. Bruneel, Performance of discrete-time queueing systems, Computers and Operations Research 20(3) (1993) 303–320.
H. Bruneel and B.G. Kim, Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic, Boston, 1993).
H. Bruneel, B. Steyaert, E. Desmet and G. Petit, Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues, European Journal of Operational Research 76 (3) (1994) 563–572.
I. Cidon, R. Guérin and A. Khamisy, On protective buffer policies, in: Proc. of INFOCOM '93, San Francisco (1993) pp.1051–1058.
M. Drmota, Systems of functional equations, Random Structures & Algorithms 10(1/2) (1997) 103–124.
D. Fiems, B. Steyaert and H. Bruneel, Analysis of a discrete-time GI-G-1 queueing model subjected to bursty interruptions, Computers and Operations Research 30(1) (2002) 139–153.
P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM Journal on Discrete Mathematics 3(2) (1990) 216–240.
E. Gelenbe, V. Srinivasan, S. Seshadri and N. Gautam, Optimal policies for ATM cell scheduling and rejection, Telecommunication Systems 18(4) (2001) 331–358.
M. Guizani and A. Al-Fuqaha, A new queueing strategy for large scale ATM switches, IEEE Communications Magazine 39(12) (2001) 142–146.
N.K. Jaiswal, Priority Queues (Academic Press, New York, 1968).
M. Karol, M. Hluchyj and S. Morgan, Input versus output queueing on a space-division packet switch, IEEE Transactions on Communications 35(12) (1987) 1347–1356.
A. Khamisy and M. Sidi, Discrete-time priority queueing systems with two-state Markov modulated arrival processes, Stochastic Models 8(2) (1992) 337–357.
K. Laevens and H. Bruneel, Discrete-time multiserver queues with priorities, Performance Evaluation 33(4) (1998) 249–275.
J. Liebeherr and D. Wrege, Priority queue schedulers with approximate sorting in output-buffered switches, IEEE Journal on Selected Areas in Communications 17(6) (1999) 1127–1144.
K. Liu et al., Design and analysis of a bandwidth management framework for ATM-based broadband ISDN, IEEE Communications Magazine 35(5) (1997) 138–145.
F. Machihara, A bridge between preemptive and non-preemptive queueing models, Performance Evaluation 23(2) (1995) 93–106.
R.G. Miller, Priority queues, Annals of Mathematical Statistics 31 (1960) 86–103.
S.P. Morgan, Queueing disciplines and passive congestion control in byte-stream networks, IEEE Transactions on Communications 39(7) (1991) 1097–1106.
A. Parekh and R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Transactions on Networking 2(2) (1994) 137–150.
A. Pattavina, Nonblocking architectures for ATM switching, IEEE Communications Magazine 31(2) (1993) 38–48.
A. Pattavina and G. Bruzzi, Analysis of input and output queueing for nonblocking ATM switches, IEEE/ACM Transactions on Networking 1(3) (1993) 314–328.
L. Takacs, Priority queues, Operations Research 12(1) (1964) 63–74.
H. Takagi, Queueing Analysis. A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems (North-Holland, Amsterdam, 1991).
T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority, Communications in Statistics Stochastic Models 10(1) (1994) 183–204.
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) (1994) 1837–1845.
C. Tham, Q. Yao and Y. Jiang, Achieving differentiated services through multi-class probabilistic priority scheduling, Computer Networks 40(4) (2002) 577–593.
J. Walraevens, B. Steyaert and H. Bruneel, Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline, Performance Evaluation 50(1) (2002) 53–75.
J. Walraevens, B. Steyaert and H. Bruneel, Performance analysis of a single-server ATM queue with a priority scheduling, Computers and Operations Research 30(12) (2003) 1807–1829.
J. Walraevens, B. Steyaert and H. Bruneel, Performance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling discipline, European Journal of Operational Research 157(1) (2004) 130–151.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Walraevens, J., Steyaert, B. & Bruneel, H. A Packet Switch with a Priority Scheduling Discipline: Performance Analysis. Telecommunication Systems 28, 53–77 (2005). https://doi.org/10.1023/B:TELS.0000048327.45979.f7
Issue Date:
DOI: https://doi.org/10.1023/B:TELS.0000048327.45979.f7