Analysis of a discrete-time preemptive resume priority buffer

In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system contents and customer delays of both classes. It is shown (theoretically as well as by some practical procedures) how moments and approximate tail probabilities of system contents and customer delays are calculated. The influence of the priority scheduling discipline and the service time distributions on the performance measures is shown by some numerical examples. Key words: Queueing, preemptive resume priority, general service times

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Joris Walraevens, Bart Steyaert, Herwig Bruneel
• Keywords: Customer, EOR 2008, Preemptive Resume, Service Times