Delay Analysis of a HOL Priority Queue

Priority scheduling for packets is a hot topic, as interactive (voice, video) services are being integrated in existing data networks. In this paper, we consider a discrete-time queueing system with a non-preemptive (or Head-Of-the-Line) priority scheduling discipline and a general number of priority classes. Packets of variable length arrive in the queueing system. We derive expressions for the probability generating functions of the packet delays. From these functions, some performance measures (such as moments and approximate probabilities) are calculated. We illustrate the performance measures by means of some numerical examples and show how to apply the theoretical results to a queue that handles arriving multimedia traffic.

[1]  Izhak Rubin,et al.  Message delay analysis of multiclass priority TDMA, FDMA, and discrete-time queueing systems , 1989, IEEE Trans. Inf. Theory.

[2]  Moshe Sidi,et al.  Discrete-time priority queues with two-state markov modulated arrivals , 1992 .

[3]  Tetsuya Takine,et al.  Analysis of a Nonpreemptive Priority Queue with SPP Arrivals of High Class , 1995, Perform. Evaluation.

[4]  Tetsuya Takine,et al.  An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes , 1994, IEEE Trans. Commun..

[5]  Herwig Bruneel,et al.  Discrete-Time Multiserver Queues with Priorities , 1998, Perform. Evaluation.

[6]  Chen-Khong Tham,et al.  Achieving differentiated services through multi-class probabilistic priority scheduling , 2002, Comput. Networks.

[7]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[8]  Y. Takahashi,et al.  Delay analysis of discrete-time priority queue with structured inputs , 1991, Queueing Syst. Theory Appl..

[9]  滝根 哲哉.  A Nonpreemptive Priority MAP/G/1 Queue with Two Classes of Customers , 1997 .

[10]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[11]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[12]  Hideaki Takagi.  Queueing analysis A foundation of Performance Evaluation Volume 1: Vacation and priority systems , 1991 .

[13]  David A. Stanford,et al.  Interdeparture-Time Distributions in the Nonpreemptive Priority \Sigma M_i/G_i/1 Queue , 1991, Perform. Evaluation.

[14]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[15]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[16]  Herwig Bruneel,et al.  Performance analysis of a single-server ATM queue with a priority scheduling , 2003, Comput. Oper. Res..

[17]  Tatsuya Suda,et al.  Mean Waiting Times in Nonpreemptive Priority Queues with Markovian Arrival and i.i.d. Service Processes , 1994, Perform. Evaluation.

[18]  Herwig Bruneel,et al.  Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline , 2002, Perform. Evaluation.

[19]  Stijn De Vuyst,et al.  on ‘ Performance Analysis Of The System Contents In A Discrete-time non-preemptive Priority Queue With General Service Times , 2001 .

[20]  Jörg Liebeherr,et al.  Priority queue schedulers with approximate sorting in output-buffered switches , 1999, IEEE J. Sel. Areas Commun..

[21]  David W. Petr,et al.  Design and analysis of a bandwidth management framework for ATM-based broadband ISDN , 1997 .

[22]  Wushow Chou,et al.  Queueing Systems, Volume II: Computer Applications - Leonard Kleinrock , 1977, IEEE Transactions on Communications.

[23]  Lajos Takács,et al.  Priority queues , 2019, The Art of Multiprocessor Programming.

[24]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .