Performance analysis of a Gi-G-1 Preemptive resume priority buffer

Abstract

In this paper, we have analyzed a discrete-time GI − G − 1 queue with a preemptive resume priority scheduling and two priority classes. We have derived the joint generating function of the system contents of both classes and the generating functions of the delay of both classes. These pgf’s are not explicitly found, but we have proven that the moments of the distributions can be found explicitly in terms of the system parameters. We have shown the impact of priority scheduling on the performance characteristics by some numerical examples.