Abstract
Inspired by service systems such as telephone call centers, we develop limit theorems for a large class of stochastic service network models. They are a special family of nonstationary Markov processes where parameters like arrival and service rates, routing topologies for the network, and the number of servers at a given node are all functions of time as well as the current state of the system. Included in our modeling framework are networks of M t /M t /n t queues with abandonment and retrials. The asymptotic limiting regime that we explore for these networks has a natural interpretation of scaling up the number of servers in response to a similar scaling up of the arrival rate for the customers. The individual service rates, however, are not scaled. We employ the theory of strong approximations to obtain functional strong laws of large numbers and functional central limit theorems for these networks. This gives us a tractable set of network fluid and diffusion approximations. A common theme for service network models with features like many servers, priorities, or abandonment is “non-smooth” state dependence that has not been covered systematically by previous work. We prove our central limit theorems in the presence of this non-smoothness by using a new notion of derivative.
Similar content being viewed by others
References
F.H. Clarke, Optimization and Nonsmooth Analysis (SIAM, Philadelphia, PA, 1990) (originally published 1983).
S.N. Ethier and T.G. Kurtz, Markov Process: Characterization and Convergence (Wiley, New York, 1986).
J. Hale, Ordinary Differential Equations (Wiley/Interscience, New York, 1969).
S. Halfin and W. Whitt, Heavy-traffic limits theorem for queues with many exponential servers, Oper. Res. 29 (1981) 567-588.
H. Hochstadt, Differential Equations: A Modern Approach (Dover, New York, 1963).
D.L. Iglehart, Limit diffusion approximations for the many server queue and the repairman problem, J. Appl. Probab. 2 (1965) 429-441.
J.R. Jackson, Jobshop-like queueing systems, Managm. Sci. 10(1) (1963) 131-142.
I. Karatzas and S.E. Shreve, Brownian Motion and Stochastic Calculus, 2nd ed. (Springer, New York, 1991).
T.G. Kurtz, Strong approximation theorems for density dependent Markov chains, Stochastic Process. Appl. 6 (1978) 223-240.
T.G. Kurtz, Representation of Markov processes as multiparameter time changes, Ann. Probab. 8(4) (1980) 682-715.
A. Mandelbaum and W.A. Massey, Strong approximations for time-dependent queues, Math. Oper. Res. 20(1) (1995) 33-64.
A. Mandelbaum, W.A. Massey, G. Pats and K. Ramanan, Approximations for time-dependent networks, in preparation.
A. Mandelbaum and G. Pats, State-dependent queues: Approximation and applications, in: IMA Volumes in Mathematics and Its Applications 71, eds. F. Kelly and R.J. Williams (Springer, Berlin, 1995) pp. 239-282.
A. Mandelbaum and G. Pats, State-dependent stochastic networks, Part I: Approximations and applications with continuous diffusion limits, Ann. Appl. Probab. 8(2) (1998) 569-646.
W.A. Massey, Asymptotic analysis of the time dependent M/M/1 queue, Math. Oper. Res. 10 (1985) 305-327.
W.A. Massey, Nonstationary queues, Ph.D. thesis, Stanford University (1981).
W.A. Massey and W. Whitt, Networks of infinite-server queues with non-stationary Poisson input, Queueing Systems 13 (1993) 183-250.
W.A. Massey and W. Whitt, Uniform acceleration expansions for Markov chains with time-varying rates, Ann. Appl. Probab., to appear (1998).
G.F. Newell, Approximate Stochastic Behavior of n-Server Service Systems with Large n (Springer, Berlin, 1973).
G. Pats, State-dependent queueing networks: Approximations and applications, Ph.D. thesis, Faculty of Industrial Engineering and Management, Technion (1994).
C.R. Rao, Linear Statistical Inference and its Applications, 2nd ed. (Wiley, New York, 1973).
R.T. Rockafellar, Convex Analysis (Princeton Univ. Press, 1970) (paperback edition 1997).
W. Whitt, On the heavy-traffic limit theorem for GI/G/∞ queues, Adv. in Appl. Probab. 14(1) (1982) 171-190.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mandelbaum, A., Massey, W.A. & Reiman, M.I. Strong approximations for Markovian service networks. Queueing Systems 30, 149–201 (1998). https://doi.org/10.1023/A:1019112920622
Issue Date:
DOI: https://doi.org/10.1023/A:1019112920622