Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline

Priority scheduling for packets is becoming a hot topic, as attemps are being made to integrate voice services in existing data networks. In this paper, we consider a discrete-time queueing system with head-of-line (HOL) non-preemptive priority scheduling. Two classes of traffic will be considered, i.e., high-priority and lowpriority traffic, which both generate variable-length packets. We will derive expressions for the Probability Generating Function of the packet delay of the high-priority traffic and the low-priority traffic. From these, some performance measures (such as the mean value) will be derived. These will be used to illustrate the significance of priority scheduling and will be applied to an output queueing switch. Key words: discrete-time queueing models, non-preemptive priority scheduling, packet delay, general service times

• Type: Journal
• Year: 2002
• Where: PE
• Authors: Joris Walraevens, Bart Steyaert, Herwig Bruneel
• Keywords: Non-preemptive Priority Scheduling, Optimization, Packet Delay, PE 2002, Priority Scheduling