Asymptotics for M/G/1 low-priority waiting-time tail probabilities

We consider the classical M/G/1 queue with two priority classes and the nonpreemptive and preemptive-resume disciplines. We show that the low-priority steady-state waiting-time can be expressed as a geometric random sum of i.i.d. random variables, just like the M/G/1 FIFO waiting-time distribution. We exploit this structures to determine the asymptotic behavior of the tail probabilities. Unlike the FIFO case, there is routinely a region of the parameters such that the tail probabilities have non-exponential asymptotics. This phenomenon even occurs when both service-time distributions are exponential. When non-exponential asymptotics holds, the asymptotic form tends to be determined by the non-exponential asymptotics for the high-priority busy-period distribution. We obtain asymptotic expansions for the low-priority waiting-time distribution by obtaining an asymptotic expansion for the busy-period transform from Kendall's functional equation. We identify the boundary between the exponential and non-exponential asymptotic regions. For the special cases of an exponential high-priority service-time distribution and of common general service-time distributions, we obtain convenient explicit forms for the low-priority waiting-time transform. We also establish asymptotic results for cases with long-tail service-time distributions. As with FIFO, the exponential asymptotics tend to provide excellent approximations, while the non-exponential asymptotics do not, but the asymptotic relations indicate the general form. In all cases, exact results can be obtained by numerically inverting the waiting-time transform.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  Ward Whitt,et al.  Waiting-time tail probabilities in queues with long-tail service-time distributions , 1994, Queueing Syst. Theory Appl..

[3]  P. Ney,et al.  Functions of probability measures , 1973 .

[4]  Ward Whitt,et al.  Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversion , 1995, Oper. Res. Lett..

[5]  J. Teugels,et al.  On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1 , 1980, Journal of Applied Probability.

[6]  Douglas R. Miller Computation of Steady-State Probabilities for M/M/1 Priority Queues , 1981, Oper. Res..

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

[8]  M. Meerschaert Regular Variation in R k , 1988 .

[9]  J. Harrison A limit theorem for priority queues in heavy traffic , 1973, Journal of Applied Probability.

[10]  Ward Whitt,et al.  An operational calculus for probability distributions via Laplace transforms , 1996, Advances in Applied Probability.

[11]  Ward Whitt,et al.  A heavy-traffic expansion for asymptotic decay rates of tail probabilities in multichannel queues , 1994, Oper. Res. Lett..

[12]  Ward Whitt,et al.  Transient Behavior of the M/G/1 Workload Process , 1994, Oper. Res..

[13]  Lokenath Debnath,et al.  Introduction to the Theory and Application of the Laplace Transformation , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  Aleksandr Alekseevich Borovkov,et al.  Stochastic processes in queueing theory , 1976 .

[15]  J. Teugels,et al.  Convergence rates for M/G/1 queues and ruin problems with heavy tails , 1996, Journal of Applied Probability.

[16]  J. Mikusiński Operational Calculus , 1959 .

[17]  Ward Whitt,et al.  On the Laguerre Method for Numerically Inverting Laplace Transforms , 1996, INFORMS J. Comput..

[18]  O. Kella Parallel and Tandem Fluid Networks with Dependent Levy Inputs , 1993 .

[19]  Ward Whitt,et al.  Limits and Approximations for the Busy-Period Distribution in Single-Server Queues , 1995, Probability in the Engineering and Informational Sciences.

[20]  Ward Whitt,et al.  Simple spectral representations for the M/M/1 queue , 1988, Queueing Syst. Theory Appl..

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

[22]  Ward Whitt,et al.  Computing Distributions and Moments in Polling Models by Numerical Transform Inversion , 1996, Perform. Evaluation.

[23]  W. Whitt,et al.  Transient behavior of the M/M/1 queue via Laplace transforms , 1988, Advances in Applied Probability.

[24]  Michel Mandjes,et al.  Large Deviations for Performance Analysis: Queues, Communications, and Computing , Adam Shwartz and Alan Weiss (New York: Chapman and Hall, 1995). , 1996, Probability in the Engineering and Informational Sciences.

[25]  Frank E. Grubbs,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

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

[27]  Nick G. Duffield,et al.  Exponents for the tails of distributions in some polling models , 1997, Queueing Syst. Theory Appl..

[28]  P. Ney,et al.  Degeneracy Properties of Subcritical Branching Processes , 1973 .

[29]  Chen-Shang Chang,et al.  Effective Bandwith in High-Speed Digital Networks , 1995, IEEE J. Sel. Areas Commun..

[30]  W. Whitt,et al.  Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue , 1994 .

[31]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[32]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times , 1995, Oper. Res..

[33]  Ward Whitt,et al.  Decompositions of theM/M/1 transition function , 1991, Queueing Syst. Theory Appl..

[34]  H. T. H. PIAGGIO,et al.  The Operational Calculus , 1943, Nature.

[35]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[36]  W. Sutton The Asymptotic Expansion of a Function Whose Operational Equivalent is Known , 1934 .

[37]  D. Gaver A Waiting Line with Interrupted Service, Including Priorities , 1962 .

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

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

[40]  Jean C. Walrand,et al.  Resource Management in Wide-Area ATM Networks Using Effective Bandwiths , 1995, IEEE J. Sel. Areas Commun..

[41]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..

[42]  F. Olver Asymptotics and Special Functions , 1974 .

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

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

[45]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[46]  Ward Whitt,et al.  Solving probability transform functional equations for numerical inversion , 1992, Oper. Res. Lett..

[47]  Ward Whitt,et al.  Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload , 1996, Oper. Res..

[48]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[49]  V. Chistyakov A Theorem on Sums of Independent Positive Random Variables and Its Applications to Branching Random Processes , 1964 .

[50]  A. Markushevich Analytic Function Theory , 1996 .

[51]  Ward Whitt,et al.  Limits and approximations for the M/G/1 LIFO waiting-time distribution , 1997, Oper. Res. Lett..

[52]  Ward Whitt,et al.  Numerical Inversion of Multidimensional Laplace Transforms by the Laguerre Method , 1998, Perform. Evaluation.

[53]  W. Whitt Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.