Sojourn Times in the M/PH/1 Processor Sharing Queue

We give in this paper an algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times. In a first step, we establish the differential system governing the conditional sojourn times probability distributions in this queue, given the number of customers in the different phases of the PH distribution at the arrival instant of a customer. This differential system is then solved by using a uniformization procedure and an exponential of matrix. The proposed algorithm precisely consists of computing this exponential with a controlled accuracy. This algorithm is then used in practical cases to investigate the impact of the variability of service times on sojourn times and the validity of the so-called reduced service rate (RSR) approximation, when service times in the different phases are highly dissymmetrical. For two-stage PH distributions, we give conjectures on the limiting behavior in terms of an M/M/1 PS queue and provide numerical illustrative examples.

[1]  Fabrice Guillemin,et al.  Tail asymptotics for processor-sharing queues , 2004, Advances in Applied Probability.

[2]  Armand M. Makowski,et al.  On a reduced load equivalence for fluid queues under subexponentiality , 1999, Queueing Syst. Theory Appl..

[3]  S. Ross.  Average delay in queues with non-stationary Poisson arrivals , 1978, Journal of Applied Probability.

[4]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[5]  G. M. Jenkins,et al.  Stochastic Service Systems. , 1964 .

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

[7]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[8]  kc claffy,et al.  The nature of the beast: Recent traffic measurements from an Internet backbone , 1998 .

[9]  R. Núñez Queija,et al.  Processor-Sharing Models for Integrated-Services Networks , 2000 .

[10]  Philippe Owezarski,et al.  Modeling Internet backbone traffic at the flow level , 2003, IEEE Trans. Signal Process..

[11]  Moshe Sidi,et al.  Modeling and analysis of power-tail distributions via classical teletraffic methods , 2000, Queueing Syst. Theory Appl..

[12]  Rahul Roy,et al.  On the coverage of space by random sets , 2004, Advances in Applied Probability.

[13]  Moshe Sidi,et al.  Modeling and analysis of heavy-tailed distributions via classical teletraffic methods , 1999 .

[14]  Ward Whitt,et al.  Numerical Inversion of Laplace Transforms of Probability Distributions , 1995, INFORMS J. Comput..

[15]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[16]  Hans van den Berg,et al.  TheM/G/1 queue with processor sharing and its relation to a feedback queue , 1991, Queueing Syst. Theory Appl..

[17]  Predrag R. Jelenkovic,et al.  Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue , 2003, Math. Oper. Res..

[18]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[19]  L. Flatto.  The waiting time distribution for the random order service $M/M/1$ queue , 1997 .

[20]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[21]  Sem C. Borst,et al.  The equivalence between processor sharing and service in random order , 2003, Oper. Res. Lett..

[22]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[23]  T. Ott.  THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[24]  A. P. Zwart,et al.  Sojourn time asymptotics in the M/G/1 processor sharing queue , 1998, Queueing Syst. Theory Appl..

[25]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[26]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[27]  FABRICE GUILLEMIN,et al.  Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory , 2001, Queueing Syst. Theory Appl..