Abstract
An M(t)/M(t)/1 queue or M/M/1 queue with time varying rates, may alternate through periods of underloading, overloading, and critical loading. We analyze this model by using a general asymptotic method called uniform acceleration, which we will show is the appropriate time-varying analogue to steady state analysis. Applying this method to the transition probabilities of the queue length process, we obtain necessary and sufficient conditions for underloading which we will show is the time-varying analogue to steady state stability.
Using the theory of strong approximations, we can also apply a similar asymptotic analysis directly to the random sample paths of the queueing process. In obtaining a functional strong law of large numbers and central limit theorem for the M(t)/M(t)/1 queue, we obtain a rigorous basis for the fluid and diffusion approximations that are used to analyze this system. Moreover, the will be many candidates for the time-varying analogue to heavy traffic limit processes. The results are presented to suggest new methods for the asymptotic analysis of nonstationary, continuous time Markov chains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asmussen, S. and Thorisson, H., A Markov Chain Approach to Periodic Queues, J. Appl. Probab., 24, 215–225, 1987.
Eick, S., Massey, W.A. and Whitt, W., Mt/G/∞ Queues with Sinusoidal Rates, Management Science, 39, 241–252, 1993.
Eick, S., Massey, W.A. and Whitt, W., The Physics of the Mt/G/∞ Queue, Operations Research, 41 (1993 to appear).
Ethier, S.N. and Kurtz, T.G., Markov Processes, Characterization and Convergence, John Wiley & Sons, 1986.
Hall, Randolph W., Queueing Methods for Services and Manufacturing, Prentice Hall Publishers, 1991.
Harrison, J.M. and Lemoine, A.J., Limit Theorems for Periodic Queues, J. Appl. Probab., 14, 566–576, 1977.
Kolmòs, Major and Tusnà dy, An Approximation of Partial Sums of Independent RV’s and the Sample DF, I; II, ZW, 32, 111–131, 1975; 34, 33–58, 1976.
Lagerstrom, P.A., Matched Asymptotic Expansions, Springer Verlag, 1988.
Lemoine, A. J., Waiting Time and Workload in Queues with Periodic Poisson Input, J. Appl. Probab., 26, 390–397, 1989.
Mandelbaum, A. and Massey, W.A., Strong Approximations for Time-Dependent Queues,. Math, of Op. Res., 20, No. 1, 33–64, 1995.
Massey, W.A., Asymptotic Analysis of the Time Dependent M/M/l Queue, Math, of Op. Res., 10, 305–327, 1985.
Massey, W.A., Nonstationary Queues, Thesis, Stanford University, 1981.
Massey, W.A. and Whitt, W., Networks of Infinite-Server Queues with Nonstationary Poisson Input, Queueing Systems, 13, No. 1–3, 183–250, 1993.
Newell, G.F., Queues with Time-Dependent Arrival Rates, I, II, III, J. Appl. Probab., 5, 436–451 (I)
Newell, G.F., Queues with Time-Dependent Arrival Rates, I, II, III, J. Appl. Probab., 5 570–590 (II) 1968
Newell, G.F., Queues with Time-Dependent Arrival Rates, I, II, III, J. Appl. Probab., 5 591–606 (III), 1968.
Newell, G.F., Applications of Queueing Theory, Chapman and Hall (Second Edition), 1982.
Prabhu, N.U., Stochastic Storage Processes: Queues, Insurance Risk, and Dams, Springer Verlag, 1980.
Prékopa A., On Poisson and Composed Poisson Stochastic Set Functions, Stud. Math. 16 (1957) 142–155.
Rolski, T., Queues with Non-Stationary Input Stream: Ross’s Conjecture, Adv. Appl. Prob., 13, 603–618, 1981.
Rothkopf, M.H. and Oren, S.S., A Closure Approximation for the Nonstationary M/M/s Queue, Mgmt. Sci., 25, 522–534, 1979.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Massey, W.A. (1996). Stability for Queues with Time Varying Rates. In: Glasserman, P., Sigman, K., Yao, D.D. (eds) Stochastic Networks. Lecture Notes in Statistics, vol 117. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4062-4_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4062-4_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94828-7
Online ISBN: 978-1-4612-4062-4
eBook Packages: Springer Book Archive