A fluid limit for an overloaded X model via a stochastic averaging principle

Mathematics of Operations Research

Volumn 38, Issue 2, 2013, Pages 294-349

  Perry, Ohad ^a   Whitt, Ward ^b  

^a Northwestern University   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

Averaging principle; Heavy traffic fluid limit; Many server queues; Overload control; Separation of time scales; State space collapse

Indexed keywords

AVERAGING PRINCIPLE; FLUID LIMITS; MANY-SERVER QUEUES; OVERLOAD CONTROL; STATE-SPACE COLLAPSE; TIME-SCALES;

LAKES; QUEUEING THEORY; SAFETY FACTOR; SALES; SEPARATION; TIME MEASUREMENT;

STOCHASTIC MODELS;

EID: 84878306484     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1120.0572     Document Type: Article

References (49)

1. Antunes N, Fricker C, Robert P, Tibi D (2006) Analysis of loss networks with routing. Ann. Appl. Prob. 16(4): 2007-2026.
2. Asmussen S (1998) Extreme value theory for queues via cycle maxima. Extremes 1(2): 137-168.
3. Asmussen S (2003) Applied Probability and Queues, 2nd ed. (Springer, New York).
4. Bassamboo A, Harrison JM, Zeevi A (2005) Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems 51(3-4): 249-285.
5. Bassamboo A, Harrison JM, Zeevi A (2006) Dynamic and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. 54(3): 419-435.
6. Baxendale P (2005) Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann. Appl. Prob. 15(1): 700-738.
7. Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (John Wiley & Sons, New York).
8. Bolthausen E (1980) The Berry-Esseen theorem for functionals of discrete Markov chains. Z. Wahrscheinlichkeitstheorie verw. Gebiete 54(1): 59-73.
9. Borkovec M, Klüppelberg C (1998) Extremal behavior of diffusion models in finance. Extremes 1(1): 47-80.
10. Coffman EG, Puhalskii AA, Reiman MI (1995) Polling systems with zero switchover times: A heavy-traffic averaging principle. Ann. Appl. Probab. 5(3): 681-719.
11. Davis RA (1982) Maximum and minimum of one-dimensional diffusions. Stochastic Processes and Their Appl. 13(1): 1-9.
12. Ethier SN, Kurtz TG (1985) Markov Processes: Characterization and Convergence (John Wiley & Sons, New York).
13. Glynn PW, Whitt W (1993) Limit theorems for cumulative processes. Stoch. Proc. Appl. 47(2): 299-314.
14. Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2): 363-396.
15. Gurvich I, Whitt W (2009) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2): 237-253.
16. Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2): 316-328.
17. He Q (1993) Differentiability of the matrices R and G in the matrix analytic method. Stochastic Models 11(1): 123-132.
18. Hunt PJ, Kurtz TG (1994) Large loss networks. Stochastic Processes and Their Appl. 53(2): 363-378.
19. Jacod J, Shiryaev AN (1987) Limit Theorems for Stoschastic Processes (Springer, Berlin).
20. Kamae T, Krengel U, O'Brien GL (1977) Stochastic inequalities on partially ordered spaces. Ann. Prob. 5(6): 899-912.
21. Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Prob. 20: 2204-2260.
22. Karr AF (1975) Weak convergence of a sequence of Markov chains. Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 33(1): 41-48.
23. Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann. Appl. Prob. 21(1): 33-114.
24. Khalil HK (2002) Nonlinear Systems (Prentice Hall, Englewood Cliffs, NJ).
25. Khasminskii RZ, Yin G (2004) On averaging principles: An asymptotic expansion approach. SIAM J. Math. Anal. 35(6): 1534-1560.
26. Kontoyiannis I, Meyn SP (2003) Spectral theory and limit theorems for geometrically ergodic Markov processes. Ann. Appl. Prob. 13(1): 304-362.
27. Kurtz TG (1992) Averaging for martingale problems and stochastic approximations, Appl. Stochastic Anal., Proc. US-French Workshop, Lecture Notes in Control Inform. Sci., Vol. 177 (Springer, Berlin), 186-209.
28. Latouche G, Ramaswami V (1999) Introduction to Matrix Analystic Methods in Stochastic Modeling (Siam and ASA, Philadelphia).
29. Leadbetter MR, Lindgren G, Rootzén H (1983) Extremes and Related Properties of Random Sequences and Processes (Springer-Verlag, New York).
30. Lindvall T (1992) Lectures on the Coupling Method (John Wiley & Sons, New York).
31. Massey WA, Whitt W (1998) Uniform acceleration expansions for Markov chains with time-varying rates. Ann. Appl. Prob. 8(4): 1130-1155.
32. Meyn SP, Tweedie RL (1993) Markov Chains and Stochastic Stability (Springer, New York).
33. Müller A, Stoyan D (2002) Comparison Methods for Stochastic Models with Risks (John Wiley & Sons, New York).
34. Pang G, Talreja R, Whitt W (2007) Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surveys 4: 193-267.
35. Perry O, Whitt W (2009) Responding to unexpected overloads in large-scale service systems. Management Sci. 55(8): 1353-1367.
36. Perry O, Whitt W (2011) A fluid approximation for service systems responding to unexpected overloads. Oper. Res. 59(5): 1159-1170.
37. Perry O, Whitt W (2011) An ODE for an overloaded X model involving a stochastic averaging principle. Stochastic Systems 1(1): 17-66.
38. Perry O, Whitt W (2012) Diffusion approximation for an overload X model via a stochastic averaging principle. Working paper, Columbia University. Available at: http:// www.columbia.edu/~ww2040/allpapers.html.
39. Resnick SI (1987) Extreme Values, Regular Variation and Point Processes (Springer-Verlag, New York).
40. Roberts GO, Rosenthal JS (1996) Quantative bounds for convergence rates of continuous time Markov processes. Electronic J. Appl. Probab. 1(9): 1-21.
41. Rootzén H (1988) Maxima and exceedances of stationary Markov chains. Adv. Appl. Probab. 20(2): 371-390.
42. Silvestrov DS, Teugels JL (1998) Limit theorems for extremes with random sample size. Adv. Appl. Prob. 30(3): 777-806.
43. Whitt W (1980) Continuity of generalized semi-Markov processes. Math. Oper. Res. 5(4): 494-501.
44. Whitt W (1981) Comparing counting processes and queues. Adv. Appl. Prob. 13(1): 207-220.
45. Whitt W (1984) Departures from a queue with many busy servers. Math. Oper. Res. 9(4): 534-544.
46. Whitt W (1991) The pointwise stationary approximation for Mt=Mt=s queues is asymptotically correct as the rates increase. Management Sci. 37(3): 307-314.
47. Whitt W (2002) Stochastic-Process Limits (Springer, New York).
48. Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10): 1449-1461.
49. Zachary S, Ziedins J (2002) A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning. Ann. Appl. Prob. 12(1): 1-22.