On the distribution of the number of customers in the symmetric M/G/1 queue

  • Authors:

  • Denis Denisov;Artëm Sapozhnikov

  • Affiliations:

  • EURANDOM, Eindhoven, The Netherlands;Department of Mathematics/Boole Centre for Research in Informatics, University College Cork, Cork, Ireland

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. [1] 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.