Controlling delay differentiation with priority jumps: analytical study

Supporting different services with different Quality of Service (QoS) requirements is not an easy task in modern telecommunication systems: an efficient priority scheduling discipline is of great importance. Fixed or static priority achieves maximal delay differentiation between different types of traffic, but may have a too severe impact on the performance of lower-priority traffic. In this paper, we propose a priority scheduling discipline with priority jumps to control the delay differentiation. In this scheduling discipline, packets can be promoted to a higher priority level in the course of time. We use probability generating functions to study the queueing system analytically. Some interesting mathematical challenges thereby arise. With some numerical examples, we finally show the impact of the priority jumps and of the system parameters.

[1]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[2]  V. Ramaswami,et al.  Algorithmic Analysis of a Dynamic Priority Queue , 1982 .

[3]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[4]  Lixia Zhang VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[5]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[6]  Johan van Leeuwaarden,et al.  Power series approximations for two-class generalized processor sharing systems , 2010, Queueing Syst. Theory Appl..

[7]  Ali Movaghar-Rahimabadi,et al.  A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy , 2004, DSN.

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

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

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

[11]  Ward Whitt,et al.  Solving probability transform functional equations for numerical inversion , 1992, Oper. Res. Lett..

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

[13]  Bruno Tuffin,et al.  Modeling and Analysis of Multi-class Threshold-Based Queues with Hysteresis Using Stochastic Petri Nets , 2002, ICATPN.

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

[15]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[16]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[17]  Joris Walraevens Discrete-time queueing models with priorities , 2004 .

[18]  Herwig Bruneel,et al.  Performance comparison of several priority schemes with priority jumps , 2008, Ann. Oper. Res..