Performance Analysis of Two Priority Queuing Systems in Tandem

In this paper, we consider a tandem of two head-of-line (HOL) non-preemptive priority queuing systems, each with a single server and a deterministic service-time. Two classes of traffic are considered, namely high priority and low priority traffic. By means of a generating function approach, we present a technique to derive closed-form expressions for the mean buffer occupancy at each node and mean delay. Finally, we illustrate our solution technique with some numerical examples, whereby we illustrate the starvation impact of the HOL priority scheduling discipline on the performance of the low-priority traffic stream. Our research highlights the important fact that the unfairness of the HOL priority scheduling becomes even more noticeable at the network level. Thus this priority mechanism should be used with caution.

[1]  Dieter Fiems,et al.  Transient analysis of a discrete-time priority queue , 2005 .

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

[3]  Young Han Kim,et al.  Performance analysis of a hybrid priority control scheme for input and output queueing ATM switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Faouzi Kamoun,et al.  Performance analysis of a non-preemptive priority queuing system subjected to a correlated Markovian interruption process , 2008, Comput. Oper. Res..

[5]  Herwig Bruneel,et al.  Place reservation: Delay analysis of a novel scheduling mechanism , 2008, Comput. Oper. Res..

[6]  Dieter Fiems,et al.  Controlling the delay trade-off between packet flows using multiple reserved places , 2008, Perform. Evaluation.

[7]  Herwig Bruneel,et al.  On priority queues with priority jumps , 2006, Perform. Evaluation.

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

[9]  Charles Knessl,et al.  A Dynamic Priority Queue Model for Simultaneous Service of Two Traffic Types , 2003, SIAM J. Appl. Math..

[10]  Moshe Sidi,et al.  Structured priority queueing systems with applications to packet-radio networks , 1983, Perform. Evaluation.

[11]  Dieter Fiems,et al.  The discrete-time preemptive repeat identical priority queue , 2006, Queueing Syst. Theory Appl..

[12]  T. Takine.  QUEUE WITH TWO CLASSES OF CUSTOMERS , 2004 .

[13]  Dieter Fiems,et al.  Calculation of output characteristics of a priority queue through a busy period analysis , 2009, Eur. J. Oper. Res..

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

[15]  Tetsuya Takine.  A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS , 1996 .

[16]  Herwig Bruneel,et al.  Analysis of a single-server ATM queue with priority scheduling , 1999 .

[17]  Marc Moeneclaey,et al.  Performance analysis of a discrete-time queueing system with priority jumps , 2009 .

[18]  D. I. Choi,et al.  Performance analysis of a dynamic priority queue for traffic control of bursty traffic in ATM networks , 2001 .

[19]  Dan Keun Sung,et al.  Performance analysis of priority leaky bucket scheme with queue-length-treshold scheduling policy , 1998 .

[20]  Herwig Bruneel,et al.  A modified HOL priority scheduling discipline: Performance analysis , 2007, Eur. J. Oper. Res..

[21]  Herwig Bruneel,et al.  Performance analysis of a single-server queue with a HOL-PJ priority scheduling discipline , 2004 .