Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion

This paper considers an M/G/1 queue where the service time for each customer is a discrete random variable taking one of N values. We call this an M/DN/1 queue. There are potential numerical problems inverting Laplace transforms associated with this queue because the service distribution is discontinuous. The purpose of this paper is to investigate the performance of numerical transform-inversion methods in analyzing this queue. We first derive continuity properties of the steady-state distribution of wait in the M/DN/1 queue. Then, we show analytically how continuity properties affect the performance of the Fourier method for inverting transforms. In particular, continuity is not required in all derivatives for best performance of the method. We also present a new inversion method specifically for the M/DN/1 queue. Finally, we give numerical experiments comparing these and four other inversion methods. Although no method clearly dominates, the recursion method performs well in most examples.

[1]  Jin Cao,et al.  Internet Traffic Tends Toward Poisson and Independent as the Load Increases , 2003 .

[2]  Ward Whitt,et al.  A Unified Framework for Numerically Inverting Laplace Transforms , 2006, INFORMS J. Comput..

[3]  L. Tu.  The Life and Works of , 2006 .

[4]  C. O'Cinneide.  Euler summation for fourier series and laplace transform inversion , 1997 .

[5]  Geert Jan Franx,et al.  A simple solution for the M/D/c waiting time distribution , 2001, Oper. Res. Lett..

[6]  D. Gross,et al.  Using the Transform Approximation Method to Analyze Queues with Heavy-Tailed Service , 2003 .

[7]  W. Whitt,et al.  The transient BMAP/G/l queue , 1994 .

[8]  Ward Whitt,et al.  An Introduction to Numerical Transform Inversion and Its Application to Probability Models , 2000 .

[9]  Maurice Yacowar,et al.  The Life and Work , 1993 .

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

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

[12]  Anja Feldmann,et al.  Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network , 1998, Perform. Evaluation.

[13]  Taka Sakurai,et al.  Numerical inversion for Laplace transforms of functions with discontinuities , 2004, Advances in Applied Probability.

[14]  Carl M. Harris,et al.  Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis , 2000, INFORMS J. Comput..

[15]  Martin J. Fischer,et al.  An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue , 2004, INFORMS J. Comput..

[16]  John F. Shortle,et al.  Analytical Distribution of Waiting Time in the M/{iD}/1 Queue , 2005, Queueing Syst. Theory Appl..

[17]  V. B. Iversen,et al.  Waiting time distribution in M/D/1 queueing systems , 1999 .

[18]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[19]  Srinivas R. Chakravarthy.  The Batch Markovian Arrival Process: A Review and Future Work , 2001 .

[20]  Ren Asmussen,et al.  Fitting Phase-type Distributions via the EM Algorithm , 1996 .

[21]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .

[22]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

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

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

[25]  R. Syski,et al.  Fundamentals of Queueing Theory , 1999, Technometrics.

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