Hostname: page-component-7dd5485656-2pp2p Total loading time: 0 Render date: 2025-10-30T16:46:28.991Z Has data issue: false hasContentIssue false
  • English
  • Français

BRAVO for Many-Server QED Systems with Finite Buffers

Part of: Markov processes Special processes

Published online by Cambridge University Press:  04 January 2016

D. J. Daley ,
Johan S. H. Van Leeuwaarden  and
Yoni Nazarathy
D. J. Daley*
Affiliation:
The University of Melbourne
Johan S. H. Van Leeuwaarden*
Affiliation:
Eindhoven University of Technology
Yoni Nazarathy*
Affiliation:
The University of Queensland
*
∗ Postal address: Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia. Email address: dndaley@gmail.com
∗∗ Postal address: Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands. Email address: j.s.h.v.leeuwaarden@tue.nl
∗∗∗ Postal address: School of Mathematics and Physics, The University of Queensland, St Lucia, Brisbane, 4072, Australia. Email address: y.nazarathy@uq.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper demonstrates the occurrence of the feature called BRAVO (balancing reduces asymptotic variance of output) for the departure process of a finite-buffer Markovian many-server system in the QED (quality and efficiency-driven) heavy-traffic regime. The results are based on evaluating the limit of an equation for the asymptotic variance of death counts in finite birth-death processes.

Keywords

Queueing system critical pointstochastic process limitPoisson distribution asymptoticsstationary Poisson queue asymptoticsHalfin-Whitt regimequeueing output variance asymptoticsbirth-death asymptotic variance

MSC classification

Primary: 60J27: Continuous-time Markov processes on discrete state spaces
Secondary: 60K25: Queueing theory

Information

Type
General Applied Probability
Information
Advances in Applied Probability , Volume 47 , Issue 1 , March 2015 , pp. 231 - 250
Copyright
© Applied Probability Trust 

References

Al Hanbali, A., Mandjes, M., Nazarathy, Y. and Whitt, W. (2011). “The asymptotic variance of departures in critically loaded queues.” Adv. Appl. Prob. 43, 243–263.CrossRefGoogle Scholar
Armony, M. and Maglaras, C. (2004). “On customer contact centers with a call-back option: customer decisions, routing rules, and system design.” Operat. Res. 52, 271–292.Google Scholar
Borst, S., Mandelbaum, A. and Reiman, M. I. (2004). “Dimensioning large call centers.” Operat. Res. 52, 17–34.CrossRefGoogle Scholar
Browne, S. and Whitt, W. (1995). “Piecewise-linear diffusion processes.“In Advances in Queueing, CRC, Boca Raton, FL, pp. 463–480.Google Scholar
Daley, D. J. (1976). “Queueing output processes.” Adv. Appl. Prob. 8, 395–415.CrossRefGoogle Scholar
Daley, D. J. (2011). “Revisiting queueing output processes: a point process viewpoint.” Queueing Systems 68, 395–405.Google Scholar
Disney, R. L. and König, D. (1985). “Queueing networks: a survey of their random processes.” SIAM Rev. 27, 335–403.Google Scholar
Feller, W. (1968). “An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.Google Scholar
Gans, N., Koole, G. and Mandelbaum, A. (2003). “Telephone call centers: tutorial, review, and research prospects.” Manufacturing Service Operat. Manag. 5, 79–141.Google Scholar
Garnett, O., Mandelbaum, A. and Reiman, M. (2002). “Designing a call center with impatient customers.” Manufacturing Service Operat. Manag. 4, 208–227.Google Scholar
Halfin, S. and Whitt, W. (1981). “Heavy-traffic limits for queues with many exponential servers.” Operat. Res. 29, 567–588.Google Scholar
Janssen, A. J. E. M., van Leeuwaarden, J. S. H. and Sanders, J. (2013). “Scaled control in the QED regime.” Performance Evaluation 70, 750–769.CrossRefGoogle Scholar
Janssen, A. J. E. M., van Leeuwaarden, J. S. H. and Zwart, B. (2011). “Refining square-root safety staffing by expanding Erlang C.” Operat. Res. 59, 1512–1522.Google Scholar
Jelenković, P., Mandelbaum, A. and Momčilović, P. (2004). “Heavy traffic limits for queues with many deterministic servers.” Queueing Systems 47, 53–69.Google Scholar
Maglaras, C. and Zeevi, A. (2004). “Diffusion approximations for a multiclass Markovian service system with ‘guaranteed’ and ‘best-effort’ service levels.” Math. Operat. Res. 29, 786–813.CrossRefGoogle Scholar
Mandelbaum, A. and Momčilović, P. (2008). “Queues with many servers: the virtual waiting-time process in the QED regime.” Math. Operat. Res. 33, 561–586.CrossRefGoogle Scholar
Massey, W. A. and Wallace, R. (2005). “An asymptotically optimal design of the M/M/c/K queue for call centers.” Unpublished manuscript.Google Scholar
Nazarathy, Y. (2011). “The variance of departure processes: puzzling behavior and open problems.” Queueing Systems 68, 385–394.CrossRefGoogle Scholar
Nazarathy, Y. and Weiss, G. (2008). “The asymptotic variance rate of the output process of finite capacity birth–death queues.” Queueing Systems 59, 135–156.Google Scholar
Pang, G., Talreja, R. and Whitt, W. (2007). “Martingale proofs of many-server heavy-traffic limits for Markovian queues.” Prob. Surveys 4, 193–267.CrossRefGoogle Scholar
Reed, J. (2009). “The G/GI/N queue in the Halfin–Whitt regime.” Ann. Appl. Prob. 19, 2211–2269.Google Scholar
Shiryayev, A. N. (1984). “Probability. Springer, New York.Google Scholar
Whitt, W. (2004). “A diffusion approximation for the G/GI/n/m queue.” Operat. Res. 52, 922–941.Google Scholar
Whitt, W. (2005). “Heavy-traffic limits for the G/H 2 */n/m queue.” Math. Operat. Res. 30, 1–27.Google Scholar