Performance analysis of a discrete-time queueing system with priority jumps

Supporting multiple types of traffic with different Quality of Service (QoS) requirements is not an easy task in modern communication networks. An efficient priority scheduling scheme is thus of great importance. The static, Head-Of-Line (HOL) priority scheme achieves differentiation between different types of traffic, but may have a too severe impact on the performance level of lower-priority traffic. We therefore propose a priority scheme with priority jumps in this paper: the Head-Of-Line Jump-If-Arrival (HOL-JIA) scheme. We show that the use of probability generating functions (pgfs) is suitable for analytically studying the system, and for illustrating the impact of priority jumps on the performance of the system.