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

Published Online:https://doi.org/10.1287/ijoc.1050.0148

References

  • Abate J., Whitt W. The Fourier-series method for inverting transforms of probability distributions. Queueing Systems (1992) 10:5–88CrossrefGoogle Scholar
  • Abate J., Whitt W. Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. (1995) 7:36–43LinkGoogle Scholar
  • Abate J., Choudhury G., Whitt W. Waiting-time tail probabilities in queues with long-tail service-time distributions. Queueing Systems (1994) 16:311–338CrossrefGoogle Scholar
  • Abate J., Choudhury G., Whitt W. On the Laguerre method for numerically inverting Laplace transforms. INFORMS J. Comput. (1996) 8:413–427LinkGoogle Scholar
  • Abate J., Choudhury G., Whitt W., Grassman W. An introduction to numerical transform inversion and its application to probability models. Computational Probability (1999) (Kluwer, Boston, MA) 257–323Google Scholar
  • Asmussen S., Nerman O., Olsson M. Fitting phase-type distributions via the EM algorithm. Scandinavian J. Statist. (1996) 23:419–441Google Scholar
  • Brill P. Properties of the waiting time in M/Dn/1 queues. (2002) . Tech. report, Department of Mathematics and Statistics, University of Windsor, Windsor, Ontario, CanadaGoogle Scholar
  • Brockmeyer E.The Life and Works of A. K. Erlang (1948) . The Copenhagen Telephone Company, Copenhagen, DenmarkGoogle Scholar
  • Cao J., Cleveland W., Lin D., Sun D., Holmes C., Denison D., Hansen M., Yu B., Mallick B. Internet traffic tends toward Poisson and independent as the load increases. Nonlinear Estimation and Classification (2003) (Springer, New York) CrossrefGoogle Scholar
  • Chakravarthy S., Krishnamoorthy A., Raju N., Ramaswami V. The batch Markovian arrival process: A review and future work. Advances in Probability and Stochastic Processes (2001) (Notable Publication, Neshanic Station, NJ) 21–40Google Scholar
  • Cohen J.The Single Server Queue (1969) (North-Holland Publishing Company, Amsterdam, The Netherlands) Google Scholar
  • Feldmann A., Whitt W. Fitting mixtures of exponential to long-tail distributions to analyze network performance models. Performance Eval. (1998) 31:245–279CrossrefGoogle Scholar
  • Fischer M., Knepley J. A numerical solution for some computational problems occurring in queueing theory. Algorithmic Methods in Probability, Studies in Management Science (1977) (Elsevier North-Holland, Amsterdam, The Netherlands) 271–285Google Scholar
  • Franx G. A simple solution for the M/D/c waiting time distribution. Oper. Res. Lett. (2001) 29:221–229CrossrefGoogle Scholar
  • Gross D., Harris C.Fundamentals of Queueing Theory (1998) 3rd ed.(Wiley, New York) Google Scholar
  • Harris C., Brill P., Fischer M. Internet-type queues with heavy-tailed interarrival times and computational methods for their analysis. INFORMS J. Comput. (2000) 12:261–271LinkGoogle Scholar
  • Iversen V., Staalhagen L. Waiting time distribution in M/D/1 queueing systems. Electronics Lett. (1999) 35:2184–2185CrossrefGoogle Scholar
  • Lucantoni D., Choudhury G., Whitt W. The transient BMAP/G/1 queue. Stochastic Models (1994) 10:145–182CrossrefGoogle Scholar
  • Newman D., Chagnot G., Perser J. Detailed methodology. Testing document, Light Reading. (2001) . http://www.lightreading.com/document.asp?doc_id=3972Google Scholar
  • O’Cinneide C. Euler summation for Fourier series and Laplace transform inversion. Comm. Statist.: Stochastic Models (1997) 13:315–337CrossrefGoogle Scholar
  • Sakurai T. Numerical inversion for Laplace transforms of functions with discontinuities. Adv. Appl. Probab. (2004) 36:616–642CrossrefGoogle Scholar
  • Shortle J. F., Brill P. H. Analytical distribution of waiting time in the M/{iD}/1 queue. Queueing Systems (2005) 50:185–197CrossrefGoogle Scholar
  • Shortle J., Fischer M., Gross D., Masi D. Using the transform approximation method to analyze queues with heavy-tailed service. J. Probab. Statist. Sci. (2003) 1:17–30Google Scholar
  • Shortle J., Brill P., Fischer M., Gross D., Masi D. An algorithm to compute the waiting time distribution for the M/G/1 queue. INFORMS J. Comput. (2004) 16:152–161LinkGoogle Scholar
  • Thompson K., Miller G., Wilder R. Wide-area Internet traffic patterns and characteristics. IEEE Network (1997) 11:10–23CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.