In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state and also for some performance measures such as the mean value of the system contents and the packet delay. The behavior of the priority queues with priority jumps will be illustrated by using these results and is compared to the FIFO scheme.
Pandey, Deepak C. and Pal, Arun K.
Delay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 9,
1, Article 1.
Available at: https://digitalcommons.pvamu.edu/aam/vol9/iss1/1
Computer Sciences Commons, Control Theory Commons, Numerical Analysis and Computation Commons