Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling
Bart Feyaerts, Stijn De Vuyst, Herwig Bruneel, Sabine Wittevrongel · Stochastic Models · 2015
In this paper, we study a discrete-time single-server queueing system where the arriving traffic consists of both delay-sensitive and delay-tolerant streams. We analyze the effects of a reservation-based scheduling discipline on the delay characteristics of both types of traffic. Under this discipline, a placeholder packet is inserted in the queue to accommodate future delay-sensitive arrivals, allowing them to bypass a part of the queue, without suppressing the delay-tolerant traffic.On the basis of a probability generating functions (pgf) approach, we analyze the system state distribution and the delay distribution for either traffic type and present closed-form expressions for the expected delays as well as the tail probabilities of the packet delays. We illustrate the results comparing the delay performance of our reservation-based scheduling discipline to the performance achieved by the traditional Absolute Priority (AP) and First In First Out (FIFO) disciplines.