Heavy-traffic limits for the G/H* 2/n/m queue

Mathematics of Operations Research

Volumn 30, Issue 1, 2005, Pages 1-27

  Whitt, Ward ^a  

^a Columbia University ^*  (United States)

Author keywords

Abandonments; Customer impatience; Diffusion approximations; Halfin Whitt regime; Heavy traffic; Multiserver queues; Queues; Reneging; Stochastic process limits

Indexed keywords

CUSTOMER IMPATIENCE; HEAVY-TRAFFIC; MULTISERVER QUEUES; QUEUES; RENEGING;

APPROXIMATION THEORY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; TELECOMMUNICATION TRAFFIC;

QUEUEING NETWORKS;

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

References (27)

1. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. Wiley, New York.
2. Borovkov, A. A. 1984. Asymptotic Methods in Queueing Theory. Springer, New York.
3. Browne, S., W. Whitt. 1995. Piecewise-linear diffusion processes. J. Dshalalow, ed. Advances in Queueing: Theory, Methods and Open Problems. CRC Press, Boca Raton, FL, 463-480.
4. Ethier, S. N., T. G. Kurtz. 1986. Markov Processes, Characterization and Convergence. Wiley, New York.
5. Garnett, O., A. Mandelbaum, M. I. Reiman. 2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management 4 208-227.
6. Glynn, P. W., W. Whitt. 1991. A new view of the heavy-traffic limit theorem for the infinite-server queue. Adv. Appl. Probab. 23 188-209.
7. Halfin, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29 567-588.
8. Jelenković, P., A. Mandelbaum, P. Momčilović. 2004. Heavy traffic limits for queues with many deterministic servers. Queueing Systems 47 53-69.
9. Karlin, S., H. M. Taylor. 1981. A Second Course in Stochastic Processes. Academic Press, New York.
10. Krichagina, E. V., A. A. Puhalskii. 1997. A heavy-traffic analysis of a closed queueing system with a GI/∞ service center. Queueing Systems 25 235-280.
11. Lions, P. L., A. S. Sznitman. 1984. Stochastic differential equations with reflecting boundary conditions. Comm. Pure Appl. Math. 37 511-537.
12. Liptser, R. Sh., A. N. Shiryaev. 1989. Theory of Martingales. Kluwer, Boston, MA.
13. Mandelbaum, A., G. Pats. 1995. State-dependent queues: Approximations and applications. F. P. Kelly, R. J. Williams, eds. Stochastic Networks, IMA Volumes in Mathematics and Its Applications. Springer, Berlin, Germany, 239-282.
14. Massey, W. A., R. Wallace. 2005. An asymptotically optimal design of the M/M/c/k queue for call centers. Queueing Systems. Forthcoming.
15. Parthasarathy, K. R. 1967. Probability Measures on Metric Spaces. Academic Press, New York.
16. Puhalskii, A. A. 1994. On the invariance principle for the first passage time. Math. Oper. Res. 19 946-954.
17. Puhalskii, A. A., M. 1. Reiman. 2000. The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. 32 564-595.
18. Rogers, L. C. G., D. Williams. 1987. Diffusions, Markov Processes and Martingales, Vol. 2, Itô Calculus, Wiley, New York.
19. Srikant, R., W. Whitt. 1996. Simulation run lengths to estimate blocking probabilities. ACM Trans. Modeling Comput. Simulation 6 7-52.
20. Stroock, D., S. R. S. Varadhan. 1979. Multidimensional Diffusion Processes. Springer, New York.
21. Ward, A. R., P. W. Glynn. 2003. A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43 103-128.
22. Whitt, W. 1981. Comparing counting processes and queues. Adv. Appl. Probab. 13 207-220.
23. Whitt, W. 1983. Comparison conjectures about the M/G/s queue. Oper. Res. Lett. 2 203-210.
24. Whitt, W. 1984. On approximations for queues, III: Mixtures of exponential distributions. AT&T Bell Lab. Tech. J. 63 163-175.
25. Whitt, W. 2002. Stochastic-Process Limits. Springer, New York.
26. Whitt, W. 2002. Internet Supplement to Stochastic-Process Limits. Available at http://www.columbia.edu/ww2040/supplement.html.
27. Whitt, W. 2004. A diffusion approximation for the G/GI/n/m queue. Oper. Res. 52, 922-941.