Some time-dependent properties of symmetric M/G/1 queues

Consider an M/G/1 queue which is idle at time 0. The number of customers sampled at an independent exponential time is shown to have the same geometric distribution under the preemptive resume last in first out (LIFO) and the processor sharing (PS) disciplines. Hence, the marginal distribution of the queue length at any time is identical for both disciplines. We then give a detailed analysis of the time until the first departure for any symmetric queueing discipline. We characterize its distribution and show that it is insensitive to the service discipline. Finally we study the tail behavior of this distribution.

[1]  C. Marshall.  The Single Server Queue, Revised Edition , 1983 .

[2]  Bert Zwart,et al.  Tail asymptotics for exponential function-als of L evy processes , 2006 .

[3]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[4]  P. Burke.  The Output of a Queuing System , 1956 .

[5]  K. Sigman.  Queues under preemptive LIFO and ladder height distributions for risk processes : A duality , 1996 .

[6]  K. Meyer.  The Output of a Queueing System , 1981 .

[7]  J. W. Cohen,et al.  The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[8]  Alexandre Proutière,et al.  Insensitivity in processor-sharing networks , 2002, Perform. Evaluation.

[9]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[10]  M. Yu. Kitaev,et al.  The M/G/1 processor-sharing model: transient behavior , 1993, Queueing Syst. Theory Appl..

[11]  Thomas Duquesne,et al.  Random Trees, Levy Processes and Spatial Branching Processes , 2002 .

[12]  Vladimir V. Kalashnikov,et al.  Tails of waiting times and their bounds , 1999, Queueing Syst. Theory Appl..

[13]  Marc Yor,et al.  Brownian analogues of Burke's theorem , 2001 .

[14]  Walter A. Rosenkrantz.  Calculation of the Laplace Transform of the Length of the Busy Period for the M|G|1 Queue Via Martingales , 1983 .

[15]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[16]  V. Limic.  A LIFO queue in heavy traffic , 2001 .

[17]  R. Wolpert.  Lévy Processes , 2000 .

[18]  M. Shalmon.  Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation , 1988, Probability in the Engineering and Informational Sciences.