Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-24T16:50:58.389Z Has data issue: false hasContentIssue false
  • English
  • Français

Transient behavior of the M/M/1 queue via Laplace transforms

Published online by Cambridge University Press:  01 July 2016

Joseph Abate  and
Ward Whitt
Joseph Abate*
Affiliation:
At & T Bell Laboratories
Ward Whitt*
Affiliation:
At & T Bell Laboratories
*
∗Postal address: AT&T Bell Laboratories, LC 2W-E06, 184 Liberty Corner Road, Warren, NJ 07060, USA.
∗∗Postal address: AT&T Bell Laboratories, MH 2C-178, Murray Hill, NJ 07974, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper shows how the Laplace transform analysis of Bailey (1954), (1957) can be continued to yield additional insights about the time-dependent behavior of the queue-length process in the M/M/1 model. A transform factorization is established that leads to a decomposition of the first moment as a function of time into two monotone components. This factorization facilitates developing approximations for the moments and determining their asymptotic behavior as . All descriptions of the transient behavior are expressed in terms of basic building blocks such as the first-passage-time distributions. The analysis is facilitated by appropriate scaling of space and time so that regulated or reflected Brownian motion (RBM) appears as the special case in which the traffic intensity ρ equals the critical value 1. An operational calculus is developed for obtaining M/M/1 results directly from corresponding RBM results as well as vice versa. The analysis thus provides useful insight about RBM approximations for queues.

Keywords

APPROACH TO STEADY STATERELAXATION TIMESBIRTH-AND-DEATH PROCESSESQUEUESBROWNIAN MOTIONFIRST-PASSAGE TIMESBUSY PERIODMOMENTS
Type
Research Article
Information
Advances in Applied Probability , Volume 20 , Issue 1 , March 1988 , pp. 145 - 178
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abate, J. and Whitt, W. (1987a) Transient behavior of regulated Brownian motion, I and II. Adv. Appl. Prob. 19, 560–598, 599-631.CrossRefGoogle Scholar
Abate, J. and Whitt, W. (1987b) Transient behavior of the M/M/1 queue: starting at the origin. Queueing Systems 2, 41–65.CrossRefGoogle Scholar
Abate, J. and Whitt, W. (1987C) The correlation functions of RBM and M/M/1. Submitted for publication.CrossRefGoogle Scholar
Abramowitz, M. and Stegun, I. A. (eds). (1972) Handbook of Mathematical Functions. Dover, New York.Google Scholar
Asmussen, S. and Thorisson, H. (1986) Large deviation results for time-dependent queue length distributions. Unpublished paper, Institute of Mathematical Statistics, Copenhagen.Google Scholar
Bailey, N. T. J. (1954) A continuous time treatment of a simple queue using generating functions. J. R. Statist. Soc. B16, 288–291.Google Scholar
Bailey, N. T. J. (1957) Some further results in the non-equilibrium theory of a simple queue. J. R. Statist. Soc. B19, 326–333.Google Scholar
Bailey, N. T. J. (1964) The Elements of Stochastic Processes with Applications to the Natural Sciences. Wiley, New York.Google Scholar
Beneš, V. E. (1963) General Stochastic Processes in the Theory of Queues. Addison-Wesley, Reading, Mass.Google Scholar
Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
Brown, M. (1980) Bounds, inequalities and monotonicity properties for some specialized renewal processes. Ann. Prob. 8, 227–240.CrossRefGoogle Scholar
Brown, M. (1981) Further monotonicity properties for specialized renewal processes. Ann. Prob. 9, 891–895.CrossRefGoogle Scholar
Champernowne, D. G. (1956) An elementary method of solution of the queueing problem with a single server and constant parameters. J. R. Statist. Soc. B18, 125–128.Google Scholar
Clifford, P. and Sudbury, A. (1985) A sample path proof of the duality for stochastically monotone Markov processes. Ann. Prob. 13, 558–565.CrossRefGoogle Scholar
Cohen, J. W. (1982) The Single Server Queue, 2nd edn. North-Holland, Amsterdam.Google Scholar
Conolly, B. (1975) Lecture Notes on Queueing Systems. Wiley, New York.Google Scholar
Cooper, R. B. (1972) Introduction to Queueing Theory. Macmillan, New York.Google Scholar
Cox, D. R. (1962) Renewal Theory. Methuen, London.Google Scholar
Cox, D. R. and Isham, V. (1986) The virtual waiting-time and related processes. Adv. Appl. Prob. 18, 558–573.CrossRefGoogle Scholar
Darling, D. A. and Siegert, A. J. F. (1953) The first passage problem for a continuous Markov process. Ann. Math. Statist. 24, 624–639.CrossRefGoogle Scholar
Delbrouck, L. E. N. (1976) Approximations for certain congestion functions in single server queueing systems. Proc. 8th International Teletraffic Congress, Melbourne, 233, 1–5.Google Scholar
Doetsch, G. (1974) Introduction to the Theory and Application of the Laplace Transformation, translated by Nader, W. Springer-Verlag, New York.CrossRefGoogle Scholar
Duda, A. (1984) Transient diffusion approximation for some queueing systems. Performance Evaluation Rev. 12, 118–128.Google Scholar
Erdélyi, A. (1956) Asymptotic Expansions. Dover, New York.Google Scholar
Feller, W. (1971) An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. Wiley, New York.Google Scholar
Gaver, D. P. Jr. (1968) Diffusion approximations and models for certain congestion problems. J. Appl. Prob. 5, 607–623.CrossRefGoogle Scholar
Gaver, D. P. Jr. and Jacobs, P. A. (1986) On inference and transient response for M/G/1 models. Naval Postgraduate School, Monterey.Google Scholar
Heyman, D. P. and Sobel, M. J. (1982) Stochastic Models in Operations Research, I. McGraw-Hill, New York.Google Scholar
Iglehart, D. L. and Whitt, W. (1970) Multiple channel queues in heavy traffic, II: sequences, networks and batches. Adv. Appl. Prob. 2, 355–369.CrossRefGoogle Scholar
Ito, K. and Mckean, H. P. Jr. (1965) Diffusion Processes and Their Sample Paths. Springer-Verlag, New York.Google Scholar
Karlin, S. (1964) Total positivity, absorption probabilities and applications. Trans. Amer. Math. Soc. 111, 34–107.CrossRefGoogle Scholar
Karlin, S. and Mcgregor, J. (1958) Many server queueing processes with Poisson input and exponential service times. Pacific J. Math. 8, 87–118.CrossRefGoogle Scholar
Keilson, J. (1979) Markov Chain Models–Rarity and Exponentiality. Springer-Verlag, New York.CrossRefGoogle Scholar
Keilson, J. (1981) On the unimodality of passage-time densities in birth-death processes. Statist. Neerlandica 35, 49–55.CrossRefGoogle Scholar
Keilson, J. and Kester, A. (1978) Unimodality preservation in Markov chains. Stoch. Proc. Appl. 7, 179–190.CrossRefGoogle Scholar
Keilson, J. and Sumita, U. (1982) Uniform stochastic ordering and related inequalities. Can. J. Statist. 10, 181–198.CrossRefGoogle Scholar
Kelly, F. P. (1979) Reversibility and Stochastic Networks. Wiley, Chichester.Google Scholar
Kelton, W. D. (1985) Transient exponential-Erlang queues and steady state simulation. Comm. ACM 28, 741–749.CrossRefGoogle Scholar
Kelton, W. D. and Law, A. M. (1985) The transient behavior of the M/M/s queue, with implications for steady-state simulation. Operat. Res. 33, 378–396.CrossRefGoogle Scholar
Kingman, J. F. C. (1966) An approach to the study of Markov processes. J. R. Statist. Soc. B28, 417–438.Google Scholar
Kingman, J. F. C. (1972) Regenerative Phenomena. Wiley, New York.Google Scholar
Kosten, L. (1973) Stochastic Theory of Service Systems. Pergamon Press, Oxford.Google Scholar
Kumar, A. and Wong, W. S. (1987) Some mean value formulas for the transient M/M/1 queue. Unpublished paper, AT & T Bell Laboratories, Holmdel, NJ.Google Scholar
Ledermann, W. and Reuter, G. E. (1954) Spectral theory for the differential equations of simple birth and death process. Phil. Trans. R. Soc. London A 246, 321–369.Google Scholar
Lee, I. (1985) Stationary Markovian Queueing Systems: An Approximation for the Transient Expected Queue Length. M.S. dissertation, Department of Electrical Engineering and Computer Science, MIT, Cambridge.Google Scholar
Lee, I. and Roth, E. (1986) Stationary Markovian queueing systems: an approximation for the transient expected queue length. Unpublished paper.Google Scholar
Lorden, G. (1970) On excess over the boundary. Ann. Math. Statist. 41, 520–527.CrossRefGoogle Scholar
Middleton, M. R. (1979) Transient Effects in M/G/1 Queues. Ph.D. dissertation, Stanford University.Google Scholar
Odoni, A. R. and Roth, A. (1983) An empirical investigation of the transient behavior of stationary queueing systems. Operat. Res. 31, 432–455.CrossRefGoogle Scholar
Ott, T. J. (1977a) The covariance function of the virtual waiting-time process in an M/G/1 queue. Adv. Appl. Prob. 9, 158–168.CrossRefGoogle Scholar
Ott, T. J. (1977b) The stable M/G/1 queue in heavy traffic and its covariance function. Adv. Appl. Prob. 9, 169–186.CrossRefGoogle Scholar
Pedgen, C. D. and Rosenshine, M. (1982) Some new results for the M/M/1 queue. Management Sci. 28, 821–828.Google Scholar
Prabhu, N. U. (1965) Queues and Inventories. Wiley, New York.Google Scholar
Prabhu, N. U. (1980) Stochastic Storage Processes. Springer-Verlag, New York.CrossRefGoogle Scholar
Riordan, J. (1961) Delays for last-come first-served service and the busy period. Bell System Tech. J. 40, 785–793.CrossRefGoogle Scholar
Riordan, J. (1962) Stochastic Service Systems. Wiley, New York.Google Scholar
Rosenlund, S. I. (1978) Transition probabilities for a truncated birth-death process. Scand. J. Statist. 5, 119–122.Google Scholar
Roth, E. (1981) An Investigation of the Transient Behavior of Stationary Queueing Systems. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge.Google Scholar
Siegmund, D. (1976) The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes. Ann. Prob. 4, 914–924.CrossRefGoogle Scholar
Siegmund, D. (1985) Sequential Analysis. Springer-Verlag, New York.CrossRefGoogle Scholar
Stone, C. (1963) Limit theorems for random walks, birth and death processes, and diffusion processes. Illinois J. Math. 7, 638–660.CrossRefGoogle Scholar
Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models, ed. Daley, D. J. Wiley, Chichester.Google Scholar
Takacs, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York.Google Scholar
Van Doorn, E. (1980) Stochastic Monotonicity and Queueing Applications of Birth-Death Processes. Lecture Notes in Statistics 4, Springer-Verlag, New York.Google Scholar
Whitt, W. (1980) Some useful functions for functional limit theorems. Math. Operat. Res. 5, 67–85.CrossRefGoogle Scholar
Whitt, W. (1982) Refining diffusion approximations for queues. Operat. Res. Letters 1, 165–169.CrossRefGoogle Scholar