Resource sharing with subexponential distributions

We investigate the distribution of the waiting time V in an M/G/1 processor sharing queue with traffic intensity /spl rho/ < 1. This queue represents a baseline model for evaluating efficient and fair network resource sharing algorithms, e.g. TCP flow control. When the distribution of job size B belongs to a class of subexponential distributions with tails heavier than e/sup -/spl radic/x/, it is shown that as x/spl rarr//spl infin/ P[V > x] = P[B > (1 - /spl rho/)x](1 + o(1)) Furthermore, we demonstrate that the preceding relationship does not hold if the job distribution has a lighter tail than e/sup -/spl radic/x/. This result provides a new tool for analyzing network congestion points with moderately heavy-tailed characteristics, e.g. log normal distributions, that have been recently empirically discovered in Web traffic. The accuracy of our approximation is confirmed with simulation experiments.

[1]  Ward Whitt,et al.  Predicting Response Times in Processor-Sharing Queues , 2000 .

[2]  Sergei Grishechkin.  GI/G/1 processor sharing queue in heavy traffic , 1994, Advances in Applied Probability.

[3]  S. F. Yashkov.  Mathematical problems in the theory of shared-processor systems , 1992 .

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

[5]  Mark S. Squillante,et al.  Web traffic modeling and Web server performance analysis , 1999, PERV.

[6]  C. Klüppelberg,et al.  Subexponential distributions , 1998 .

[7]  Predrag R. Jelenkovic,et al.  Reduced Load Equivalence under Subexponentiality , 2004, Queueing Syst. Theory Appl..

[8]  S. F. Yashkov.  On a heavy traffic limit theorem for the M/G/1 processor-sharing queue , 1993 .

[9]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[10]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[11]  Walter Willinger,et al.  Self-Similar Network Traffic and Performance Evaluation , 2000 .

[12]  Zhen Liu,et al.  Web traffic modeling and performance comparison between HTTP1.0 and HTTP1.1 , 2000 .

[13]  A. Pakes.  ON THE TAILS OF WAITING-TIME DISTRIBUTIONS , 1975 .

[14]  Rudesindo Núñez-Queija,et al.  Queues with Equally Heavy Sojourn Time and Service Requirement Distributions , 2002 .

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

[16]  Andrew Odlyzko,et al.  Large deviations of sums of independent random variables , 1988 .

[17]  Ravi R. Mazumdar,et al.  Asymptotic analysis of GPS systems fed by heterogeneous long-tailed sources , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[19]  Sem C. Borst,et al.  Generalised processor sharing networks fed by heavy-tailed traffic flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  A. Lazar,et al.  Asymptotic results for multiplexing subexponential on-off processes , 1999, Advances in Applied Probability.

[21]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[22]  A. Nagaev.  Integral Limit Theorems Taking Large Deviations Into Account When Cramér’s Condition Does Not Hold. II , 1969 .

[23]  Predrag R. Jelenkovic,et al.  Network multiplexer with generalized processor sharing and heavy-tailed on-off flows , 2001 .

[24]  A. P. Zwart,et al.  Sojourn times in a multiclass processor sharing queue , 1998 .

[25]  Sem C. Borst,et al.  Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows , 2003, Queueing Syst. Theory Appl..

[26]  Donald F. Towsley,et al.  The customer response times in the processor sharing queue are associated , 1990, Queueing Syst. Theory Appl..

[27]  Claudia Kliippelberg,et al.  Subexponential distributions and characterizations of related classes , 1989 .

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

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

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

[31]  Ward Whitt,et al.  Asymptotics for M/G/1 low-priority waiting-time tail probabilities , 1997, Queueing Syst. Theory Appl..

[32]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[33]  Venkat Anantharam,et al.  Scheduling strategies and long-range dependence , 1999, Queueing Syst. Theory Appl..

[34]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[35]  Bhaskar Sengupta,et al.  An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue , 1992 .

[36]  A. V. Nagaev.  On a Property of Sums of Independent Random Variables , 1978 .

[37]  C. Klüppelberg.  Subexponential distributions and integrated tails. , 1988 .

[38]  Zhen Liu,et al.  Traffic model and performance evaluation of Web servers , 2001, Perform. Evaluation.

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

[40]  K. Sigman,et al.  Sampling at subexponential times, with queueing applications , 1999 .

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