The mean waiting time in a G/G/m/∞ queue with the LCFS-P service discipline

Abstract

A single- or multiserver queue with work-conserving service discipline and a stationary and ergodic input stream with bounded service times and arbitrarily light traffic intensity may have infinite mean waiting time. We give an example of this paradox and we also give a mixing condition which, in the case of the preemptive-resume LCFS discipline, excludes this phenomenon. Furthermore, the same methods allow to estimate the durations of the first busy period and cycle and the number of customers served in the first busy cycle of a work-conserving queue.