Strong approximations for Markovian service networks

Queueing Systems

Volumn 30, Issue 1-2, 1998, Pages 149-201

  Mandelbaum, Avi ^a   Massey, William A ^b   Reiman, Martin I ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Diffusion approximations; Fluid approximations; Jackson networks; Multiserver queues; Nonstationary queues; Priority queues; Queueing networks; Queues with abandonment; Queues with retrials; Strong approximations

Indexed keywords

DIFFUSION IN LIQUIDS; MARKOV PROCESSES; QUEUEING NETWORKS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TELECOMMUNICATION INDUSTRY;

DIFFUSION APPROXIMATIONS; FLUID APPROXIMATION; JACKSON NETWORKS; MULTI-SERVER QUEUE; NONSTATIONARY; PRIORITY QUEUES; QUEUES WITH ABANDONMENT; QUEUES WITH RETRIALS; STRONG APPROXIMATION;

QUEUEING THEORY;

EID: 0032264872     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019112920622     Document Type: Article

References (23)

1. F.H. Clarke, Optimization and Nonsmooth Analysis (SIAM, Philadelphia, PA, 1990) (originally published 1983).
2. S.N. Ethier and T.G. Kurtz, Markov Process: Characterization and Convergence (Wiley, New York, 1986).
3. J. Hale, Ordinary Differential Equations (Wiley/Interscience, New York, 1969).
4. S. Halfin and W. Whitt, Heavy-traffic limits theorem for queues with many exponential servers, Oper. Res. 29 (1981) 567-588.
5. H. Hochstadt, Differential Equations: A Modern Approach (Dover, New York, 1963).
6. D.L. Iglehart, Limit diffusion approximations for the many server queue and the repairman problem, J. Appl. Probab. 2 (1965) 429-441.
7. J.R. Jackson, Jobshop-like queueing systems, Managm. Sci. 10(1) (1963) 131-142.
8. I. Karatzas and S.E. Shreve, Brownian Motion and Stochastic Calculus, 2nd ed. (Springer, New York, 1991).
9. T.G. Kurtz, Strong approximation theorems for density dependent Markov chains, Stochastic Process. Appl. 6 (1978) 223-240.
10. T.G. Kurtz, Representation of Markov processes as multiparameter time changes, Ann. Probab. 8(4) (1980) 682-715.
11. A. Mandelbaum and W.A. Massey, Strong approximations for time-dependent queues, Math. Oper. Res. 20(1) (1995) 33-64.
12. A. Mandelbaum, W.A. Massey, G. Pats and K. Ramanan, Approximations for time-dependent networks, in preparation.
13. 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.
14. 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.
15. W.A. Massey, Asymptotic analysis of the time dependent M/M/1 queue, Math. Oper. Res. 10 (1985) 305-327.
16. W.A. Massey, Nonstationary queues, Ph.D. thesis, Stanford University (1981).
17. W.A. Massey and W. Whitt, Networks of infinite-server queues with non-stationary Poisson input, Queueing Systems 13 (1993) 183-250.
18. W.A. Massey and W. Whitt, Uniform acceleration expansions for Markov chains with time-varying rates, Ann. Appl. Probab., to appear (1998).
19. G.F. Newell, Approximate Stochastic Behavior of n-Server Service Systems with Large n (Springer, Berlin, 1973).
20. G. Pats, State-dependent queueing networks: Approximations and applications, Ph.D. thesis, Faculty of Industrial Engineering and Management, Technion (1994).
21. C.R. Rao, Linear Statistical Inference and its Applications, 2nd ed. (Wiley, New York, 1973).
22. R.T. Rockafellar, Convex Analysis (Princeton Univ. Press, 1970) (paperback edition 1997).
23. W. Whitt, On the heavy-traffic limit theorem for GI/G/∞ queues, Adv. in Appl. Probab. 14(1) (1982) 171-190.