Abstract
An APPL extension that computes the exact distribution of the nth customer’s sojourn time in an M∕M∕s queue with k customers initially present is derived in this chapter. Algorithms for computing the covariance between sojourn times for an M∕M∕1 queue with k customers present at time zero are also developed. Maple computer code is developed to implement the transient queue analysis for many system measures of performance without regard to traffic intensity (i.e., the system may be unstable with traffic intensity greater than one).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abate J, Whitt W (1988) Transient behavior of the M∕M∕1 queue via Laplace transforms. Adv Appl Probab 20:145–178
e Silva ES, Gail HR, Campos RV (1995) Calculating transient distributions of cumulative reward. In: Proceedings of the 1995 ACM SIGMETRICS joint international conference on measurement and modeling of computer systems, pp 231–240
Gafarian AV, Ancker CJ Jr, Morisaku T (1976) The problem of the initial transient in digital computer simulation. In: Proceedings of the 76 bicentennial conference on winter simulation, pp 49–51
Grassmann WK (1977) Transient solutions in Markovian queueing systems. Comput Oper Res 4:47–53
Grassmann WK (2008) Warm-up periods in simulation can be detrimental. Probab Eng Inform Sci 22:415–429
Hagwood C (2009) An application of the residue calculus: the distribution of the sum of nonhomogeneous gamma variates. Am Stat 63:37–39
Hillier FS, Lieberman GJ (2010) Introduction to operations research, 9th edn. McGraw–Hill, New York
Hogg RV, McKean JW, Craig AT (2005) Introduction to the mathematical statistics, 6th edn. Prentice-Hall, Upper Saddle River, New Jersey
Kelton WD (1985) Transient exponential-Erlang queues and steady-state simulation. Commun ACM 28:741–749
Kelton WD, Law AM (1985) The transient behavior of the M∕M∕s queue, with implications for steady-state simulation. Oper Res 33:378–396
Kleinrock L (1975) Queueing systems. Wiley, New York
Law AM (1975) A comparison of two techniques for determining the accuracy of simulation output. Technical Report 75–11, University of Wisconsin at Madison
Leguesdron P, Pellaumail J, Rubino G, Sericola B (1993) Transient analysis of the M∕M∕1 queue. Adv Appl Probab 25:702–713
Morisaku T (1976) Techniques for data-truncation in digital computer simulation. Ph.D. thesis, University of Southern California, Los Angeles
Odoni AR, Roth E (1983) Empirical investigation of the transient behavior of stationary queueing systems. Oper Res 31:432–455
Parthasarathy PR (1987) A transient solution to an M∕M∕1 queue: a simple approach. Adv Appl Probab 19:997–998
Pegden CD, Rosenshine M (1982) Some new results for the M∕M∕1 queue. Manage Sci 28:821–828
Ruskey F, Williams A (2008) Generating balanced parentheses and binary trees by prefix shifts. In: Proceedings of the 12th computing: the Australasian theory symposium (CATS2008), CRPIT, vol 77, pp 107–115
Stanley RP (1999) Enumerative combinatorics. Volume 62 of Cambridge studies in advanced mathematics. Cambridge University Press, Cambridge
Winston WL (2004) Operations research: applications and algorithms, 4th edn. Thompson, Belmont, California
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Drew, J.H., Evans, D.L., Glen, A.G., Leemis, L.M. (2017). Transient Queueing Analysis. In: Computational Probability. International Series in Operations Research & Management Science, vol 246. Springer, Cham. https://doi.org/10.1007/978-3-319-43323-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-43323-3_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-43321-9
Online ISBN: 978-3-319-43323-3
eBook Packages: Business and ManagementBusiness and Management (R0)