Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

For the G/G/1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the M/G/1 queue with Processor Sharing, Zwart and Boxma [26] showed that under the same assumptions on the service requirement distribution, the two tails are “equally heavy”. By means of a probabilistic analysis we provide a new insightful proof of this result, allowing for the slightly weaker assumption of service requirement distributions with a tail of intermediate regular variation. The new approach allows us to also establish the “tail equivalence” for two other service disciplines: Foreground–Background Processor Sharing and Shortest Remaining Processing Time. The method can also be applied to more complicated models, for which no explicit formulas exist for (transforms of) the sojourn time distribution. One such model is the M/G/1 Processor Sharing queue with service that is subject to random interruptions. The latter model is of particular interest for the performance analysis of communication networks.

[1]  Laurent Massoulié,et al.  Arguments in favour of admission control for TCP flows , 1999 .

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

[3]  Shoichi Noguchi,et al.  An Analysis of the M/G/1 Queue Under Round-Robin Scheduling , 1971, Oper. Res..

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

[5]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[6]  J. Cohen SOME RESULTS ON REGULAR VARIATION FOR DISTRIBUTIONS IN QUEUEING AND FLUCTUATION THEORY , 1973 .

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

[8]  S. Grishechkin On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes , 1992, Advances in Applied Probability.

[9]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[10]  Mor Harchol-Balter,et al.  Implementation of SRPT Scheduling in Web Servers , 2000 .

[11]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[12]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

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

[14]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

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

[16]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[17]  Kiran M. Rege,et al.  A decomposition theorem and related results for the discriminatory processor sharing queue , 1994, Queueing Syst. Theory Appl..

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

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

[20]  R. Núñez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in a Processor Sharing Queue with Service Interruptions Sojourn times in a Processor Sharing Queue with Service Interruptions , 2022 .

[21]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[22]  S. Grishechkin Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing , 1992 .

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

[24]  R. Núñez-Queija,et al.  Sojourn times in a processor sharing queue with service interruptions , 1999 .

[25]  D. B. Cline,et al.  Intermediate Regular and Π Variation , 1994 .

[26]  Predrag R. Jelenkovic,et al.  Resource sharing with subexponential distributions , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.