Transient Queueing Analysis

References

• Abate J., Whitt W. Transient behavior of the M/M/1 queue via Laplace transforms. Adv. Appl. Probab. (1988) 20(1):145–178Crossref, Google Scholar
• de Souza e Silva E. S., Gail H. R., Campos R. V., Gaither B. D. Calculating transient distributions of cumulative reward. Proc. 1995 ACM SIGMETRICS Joint Internat. Conf. Measurement Model. Comput. Systems (1995) (ACM, New York) 231–240Crossref, Google Scholar
• Gafarian A. V., Ancker C. J., Morisaku T. The problem of the initial transient in digital computer simulation. Proc. 76 Bicentennial Conf. Winter Simul. (1976) Gaithersburg, MD:49–51Google Scholar
• Glen A. G., Evans D. L., Leemis L. M. APPL: A probability programming language. Amer. Statistician (2001) 55(2):156–166Crossref, Google Scholar
• Grassmann W. K. Transient solutions in Markovian queueing systems. Comput. Oper. Res. (1977) 4(1):47–53Crossref, Google Scholar
• Grassmann W. K. Warm-up periods in simulation can be detrimental. Probab. Engrg. Inform. Sci. (2008) 22(3):415–429Crossref, Google Scholar
• Hagwood C. An application of the residue calculus: The distribution of the sum of nonhomogeneous gamma variates. Amer. Statistician (2009) 63(1):37–39Crossref, Google Scholar
• Hillier F. S., Lieberman G. J.Introduction to Operations Research (2005) (McGraw-Hill, New York) Google Scholar
• Hogg R. V., Craig A. T., McKean J.Introduction to Mathematical Statistics (2005) (Macmillan, New York) Google Scholar
• Kelton W. D. Transient exponential—Erlang queues and steady-state simulation. Comm. ACM (1985) 28(7):741–749Crossref, Google Scholar
• Kelton W. D., Law A. M. The transient behavior of the M/M/s queue, with implications for steady-state simulation. Oper. Res. (1985) 33(2):378–396Link, Google Scholar
• Kleinrock L.Queueing Systems (1975) (John Wiley & Sons, New York) Google Scholar
• Law A. M. A comparison of two techniques for determining the accuracy of simulation output. (1975) . Technical Report 75–11, University of Wisconsin–Madison, MadisonGoogle Scholar
• Leguesdron P., Pellaumail J., Rubino G., Sericola B. Transient analysis of the M/M/1 queue. Adv. Appl. Probab. (1993) 25(3):702–713Crossref, Google Scholar
• Morisaku T. Techniques for data-truncation in digital computer simulation. (1976) . Ph.D. thesis, University of Southern California, Los AngelesGoogle Scholar
• Odoni A. R., Roth E. An empirical investigation of the transient behavior of stationary queueing systems. Oper. Res. (1983) 31(3):432–455Link, Google Scholar
• Parthasarathy P. R. A transient solution to an M/M/1 queue: A simple approach. Adv. Appl. Probab. (1987) 19(4):997–998Crossref, Google Scholar
• Pegden C. D., Rosenshine M. Some new results for the M/M/1 queue. Management Sci. (1982) 28(7):821–828Link, Google Scholar
• Ruskey F., Williams A., Harland J., Manyem P. Generating balanced parentheses and binary trees by prefix shifts. Proc. 14th Sympos. Comput.: Australasian Theory (2008) 77(Australian Computer Society, Darlinghurst, NSW, Australia) 107–115Google Scholar
• Stanley R. P.Enumerative Combinatorics: Volume 2 (1999) 62(Cambridge University Press, Cambridge, UK) Cambridge Studies in Advanced MathematicsCrossref, Google Scholar
• Winston W. L.Operations Research: Applications and Algorithms (2004) (Thomson, Belmont, CA) Google Scholar