Skip to main content
Log in

Uniform stability of some large-scale parallel server networks

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper we study the uniform stability properties of two classes of parallel server networks with multiple classes of jobs and multiple server pools of a tree topology. These include a class of networks with a single nonleaf server pool, such as the ‘N’ and ‘M’ models, and networks of any tree topology with class-dependent service rates. We show that with \(\sqrt{n}\) safety staffing, and no abandonment, in the Halfin–Whitt regime, the diffusion-scaled controlled queueing processes are exponentially ergodic and their invariant probability distributions are tight, uniformly over all stationary Markov controls. We use a unified approach in which the same Lyapunov function is used in the study of the prelimit and diffusion limit. A parameter called the spare capacity (safety staffing) of the network plays a central role in characterizing the stability results: the parameter being positive is necessary and sufficient that the limiting diffusion is uniformly exponentially ergodic over all stationary Markov controls. We introduce the concept of “system-wide work conserving policies," which are defined as policies that minimize the number of idle servers at all times. This is stronger than the so-called joint work conservation. We show that, provided the spare capacity parameter is positive, the diffusion-scaled processes are geometrically ergodic and the invariant distributions are tight, uniformly over all “system-wide work conserving policies." In addition, when the spare capacity is negative we show that the diffusion-scaled processes are transient under any stationary Markov control, and when it is zero, they cannot be positive recurrent.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Aksin, Z., Armony, M., Mehrotra, V.: The modern call center: a multi-disciplinary perspective on operations management research. Prod. Oper. Manage. 16, 665–688 (2007)

    Article  Google Scholar 

  2. Arapostathis, A., Biswas, A., Pang, G.: Ergodic control of multi-class M/M/N + M queues in the Halfin-Whitt regime. Ann. Appl. Probab. 25(6), 3511–3570 (2015)

    Article  Google Scholar 

  3. Arapostathis, A., Borkar, V.S., Ghosh, M.K.: Ergodic Control of Diffusion Processes, Encyclopedia of Mathematics and its Applications, vol. 143, Cambridge University Press, Cambridge (2012)

  4. Arapostathis, A., Hmedi, H., Pang, G.: On uniform exponential ergodicity of Markovian multiclass many-server queues in the Halfin-Whitt regime. Math. Oper. Res. 46(2), 772–796 (2021)

  5. Arapostathis, A., Pang, G.: Ergodic diffusion control of multiclass multi-pool networks in the Halfin-Whitt regime. Ann. Appl. Probab. 26(5), 3110–3153 (2016)

    Article  Google Scholar 

  6. Arapostathis, A., Pang, G.: Infinite-horizon average optimality of the N-network in the Halfin-Whitt regime. Math. Oper. Res. 43(3), 838–866 (2018)

    Article  Google Scholar 

  7. Arapostathis, A., Pang, G.: Infinite horizon asymptotic average optimality for large-scale parallel server networks. Stochast. Process. Appl. 129(1), 283–322 (2019)

    Article  Google Scholar 

  8. Arapostathis, A., Pang, G., Sandrić, N.: Ergodicity of a Lévy-driven SDE arising from multiclass many-server queues. Ann. Appl. Probab. 29(2), 1070–1126 (2019)

    Article  Google Scholar 

  9. Armony, M., Israelit, S., Mandelbaum, A., Marmor, Y.N., Tseytlin, Y., Yom-Tov, G.B.: On patient flow in hospitals: a data-based queueing-science perspective. Stoch. Syst. 5(1), 146–194 (2015)

    Article  Google Scholar 

  10. Atar, R.: A diffusion model of scheduling control in queueing systems with many servers. Ann. Appl. Probab. 15(1B), 820–852 (2005)

    Article  Google Scholar 

  11. Atar, R.: Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann. Appl. Probab. 15(4), 2606–2650 (2005)

    Article  Google Scholar 

  12. Borst, S., Mandelbaum, A., Reiman, M.I.: Dimensioning large call centers. Oper. Res. 52(1), 17–34 (2004)

    Article  Google Scholar 

  13. Braverman, A., Dai, J.G., Miyazawa, M.: Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach. Stoch. Syst. 7(1), 143–196 (2017)

    Article  Google Scholar 

  14. Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S., Zhao, L.: Statistical analysis of a telephone call center: a queueing-science perspective. J. Amer. Statist. Assoc. 100, 469 (2005)

    Article  Google Scholar 

  15. Budhiraja, A., Lee, C.: Stationary distribution convergence for generalized Jackson networks in heavy traffic. Math. Oper. Res. 34(1), 45–56 (2009)

    Article  Google Scholar 

  16. Dieker, A.B., Gao, X.: Positive recurrence of piecewise Ornstein-Uhlenbeck processes and common quadratic Lyapunov functions. Ann. Appl. Probab. 23(4), 1291–1317 (2013)

    Article  Google Scholar 

  17. Gamarnik, D., Stolyar, A.L.: Multiclass multiserver queueing system in the Halfin-Whitt heavy traffic regime: asymptotics of the stationary distribution. Queueing Syst. 71(1–2), 25–51 (2012)

    Article  Google Scholar 

  18. Gamarnik, D., Zeevi, A.: Validity of heavy traffic steady-state approximation in generalized Jackson networks. Ann. Appl. Probab. 16(1), 56–90 (2006)

    Article  Google Scholar 

  19. Gans, N., Koole, G., Mandelbaum, A.: Telephone call centers: Tutorial, review and research prospects. Manuf. Serv. Oper. Manag. 5, 79–141 (2003)

    Article  Google Scholar 

  20. Garnett, O., Mandelbaum, A., Reiman, M.I.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4(3), 208–227 (2002)

    Article  Google Scholar 

  21. Gurvich, I.: Validity of heavy-traffic steady-state approximations in multiclass queueing networks: the case of queue-ratio disciplines. Math. Oper. Res. 39(1), 121–162 (2014)

    Article  Google Scholar 

  22. Gyöngy, I., Krylov, N.: Existence of strong solutions for Itô’s stochastic equations via approximations. Probab. Theory Related Fields 105(2), 143–158 (1996)

    Article  Google Scholar 

  23. Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3), 567–588 (1981)

    Article  Google Scholar 

  24. Hmedi, H., Arapostathis, A., Pang, G.; On system-wide safety staffing of large-scale parallel server networks. Oper. Res. (2022). https://doi.org/10.1287/opre.2021.2256

  25. Shi, P., Chou, M., Dai, J.G., Ding, D., Sim, J.: Models and insights for hospital inpatient operations: time-dependent ed boarding time. Manage. Sci. 62(1), 1–28 (2016)

    Article  Google Scholar 

  26. Stolyar, A.L.: Diffusion-scale tightness of invariant distributions of a large-scale flexible service system. Adv. in Appl. Probab. 47(1), 251–269 (2015)

    Article  Google Scholar 

  27. Stolyar, A.L.: Tightness of stationary distributions of a flexible-server system in the Halfin-Whitt asymptotic regime. Stoch. Syst. 5(2), 239–267 (2015)

    Article  Google Scholar 

  28. Stolyar, A.L., Yudovina, E.: Tightness of invariant distributions of a large-scale flexible service system under a priority discipline. Stoch. Syst. 2(2), 381–408 (2012)

    Article  Google Scholar 

  29. Stolyar, A.L., Yudovina, E.: Systems with large flexible server pools: instability of natural load balancing. Ann. Appl. Probab. 23(5), 2099–2138 (2013)

    Article  Google Scholar 

  30. van der Boor, M., Borst, S.C., van Leeuwaarden, J.S.H., Mukherjee, D.: Scalable load balancing in networked systems: a survey of recent advances. SIAM Rev. (2022). https://doi.org/10.48550/arXiv.1806.05444

  31. Van Leeuwaarden, J.S.H., Mathijsen, B.W.J., Zwart, B.: Economies-of-scale in resource sharing systems: tutorial and partial review of the QED heavy-traffic regime. SIAM Rev. 61(3), 403–440 (2019)

  32. Whitt, W.: Understanding the efficiency of multi-server service systems. Manage. Sci. 38(5), 708–723 (1992)

    Article  Google Scholar 

  33. Williams, R.J.: On dynamic scheduling of a parallel server system with complete resource pooling, Fields Institute Communications, vol. 28, American Mathematical Society, Providence, RI (2000)

  34. Ye, H.-Q., Yao, D.D.: Diffusion limit of fair resource control-stationarity and interchange of limits. Math. Oper. Res. 41(4), 1161–1207 (2016)

    Article  Google Scholar 

  35. Ye, H.-Q., Yao, D.D.: Justifying diffusion approximations for multiclass queueing networks under a moment condition. Ann. Appl. Probab. 28(6), 3652–3697 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported in part by the Army Research Office through Grant W911NF-17-1-0019, and in part by National Science Foundation Grants DMS-1715210, DMS-1715875 and DMS-2216765, and in part by the Office of Naval Research through Grant N00014-16-1-2956 and was approved for public release under DCN #43-5454-19.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guodong Pang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hmedi, H., Arapostathis, A. & Pang, G. Uniform stability of some large-scale parallel server networks. Queueing Syst 102, 509–552 (2022). https://doi.org/10.1007/s11134-022-09850-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-022-09850-y

Keywords

Mathematics Subject Classification

Navigation