On the distribution of the number of customers in the symmetric M/G/1 queue
We consider an M/G/1 queue with symmetric service discipline. The class of symmetric service disciplines contains, in particular, the preemptive last-come-first-served discipline and the processor-sharing discipline. It has been conjectured in Kella et al.  that the marginal distribution of the queue length at any time is identical for all symmetric disciplines if the queue starts empty. In this paper we show that this conjecture is true if service requirements have an Erlang distribution. We also show by a counterexample, involving the hyperexponential distribution, that the conjecture is generally not true.
KeywordsSymmetric queue Time-dependent analysis Insensitivity Processor-sharing queue Last come first served queue
Unable to display preview. Download preview PDF.
- 2.F.P. Kelly, Reversibility and Stochastic Networks (John Wiley, Chichester, 1979).Google Scholar