IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v101y2022i3d10.1007_s11134-022-09847-7.html
   My bibliography  Save this article

A load balancing system in the many-server heavy-traffic asymptotics

Author

Listed:
  • Daniela Hurtado-Lange

    (William & Mary)

  • Siva Theja Maguluri

    (Georgia Institute of Technology)

Abstract

We study a load balancing system in the many-server heavy-traffic regime. We consider a system with N servers, where jobs arrive to the system according to a Poisson process and have an exponentially distributed size with mean 1. We parametrize the arrival rate so that the arrival rate per server is $$1-N^{-\alpha }$$ 1 - N - α , where $$\alpha >0$$ α > 0 is a parameter that represents how fast the load grows with respect to the number of servers. The many-server heavy-traffic regime corresponds to the limit as $$N\rightarrow \infty $$ N → ∞ , and subsumes several regimes, such as the Halfin–Whitt regime ( $$\alpha =1/2$$ α = 1 / 2 ), the NDS regime ( $$\alpha =1$$ α = 1 ), as $$\alpha \downarrow 0$$ α ↓ 0 it approximates mean field and as $$\alpha \rightarrow \infty $$ α → ∞ it approximates the classical heavy-traffic regime. Most of the prior work focuses on regimes with $$\alpha \in [0,1]$$ α ∈ [ 0 , 1 ] . In this paper, we focus on the case when $$\alpha >1$$ α > 1 and the routing algorithm is power-of-d choices with $$d=\lceil cN^\beta \rceil $$ d = ⌈ c N β ⌉ for some constants $$c>0$$ c > 0 and $$\beta \ge 0$$ β ≥ 0 . We prove that $$\alpha +\beta >3$$ α + β > 3 is sufficient to observe that the average queue length scaled by $$N^{1-\alpha }$$ N 1 - α converges to an exponential random variable. In other words, if $$\alpha +\beta >3$$ α + β > 3 , the scaled average queue length behaves similarly to the classical heavy-traffic regime. In particular, this result implies that if d is constant, we require $$\alpha >3$$ α > 3 and if routing occurs according to JSQ we require $$\alpha >2$$ α > 2 . We provide two proofs to our result: one based on the Transform method introduced in Hurtado-Lange and Maguluri (Stoch Syst 10(4):275–309, 2020) and one based on Stein’s method. In the second proof, we also compute the rate of convergence in Wasserstein’s distance. In both cases, we additionally compute the rate of convergence in expected value. All of our proofs are powered by state space collapse.

Suggested Citation

  • Daniela Hurtado-Lange & Siva Theja Maguluri, 2022. "A load balancing system in the many-server heavy-traffic asymptotics," Queueing Systems: Theory and Applications, Springer, vol. 101(3), pages 353-391, August.
  • Handle: RePEc:spr:queues:v:101:y:2022:i:3:d:10.1007_s11134-022-09847-7
    DOI: 10.1007/s11134-022-09847-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-022-09847-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-022-09847-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Varun Gupta & Neil Walton, 2019. "Load Balancing in the Nondegenerate Slowdown Regime," Operations Research, INFORMS, vol. 67(1), pages 281-294, January.
    2. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    3. Alison L. Gibbs & Francis Edward Su, 2002. "On Choosing and Bounding Probability Metrics," International Statistical Review, International Statistical Institute, vol. 70(3), pages 419-435, December.
    4. Rami Atar, 2012. "A Diffusion Regime with Nondegenerate Slowdown," Operations Research, INFORMS, vol. 60(2), pages 490-500, April.
    5. Alexander L. Stolyar, 2017. "Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 31-65, February.
    6. Anton Braverman, 2020. "Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1069-1103, August.
    7. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    8. J. G. Dai & Tolga Tezcan, 2011. "State Space Collapse in Many-Server Diffusion Limits of Parallel Server Systems," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 271-320, May.
    9. Siva Theja Maguluri & Sai Kiran Burle & R. Srikant, 2018. "Optimal heavy-traffic queue length scaling in an incompletely saturated switch," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 279-309, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anton Braverman, 2020. "Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 45(3), pages 1069-1103, August.
    2. Varun Gupta & Neil Walton, 2019. "Load Balancing in the Nondegenerate Slowdown Regime," Operations Research, INFORMS, vol. 67(1), pages 281-294, January.
    3. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    4. Jinsheng Chen & Jing Dong & Pengyi Shi, 2020. "A survey on skill-based routing with applications to service operations management," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 53-82, October.
    5. Debankur Mukherjee, 2022. "Rates of convergence of the join the shortest queue policy for large-system heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 317-319, April.
    6. Debankur Mukherjee & Sem C. Borst & Johan S. H. van Leeuwaarden & Philip A. Whiting, 2020. "Asymptotic Optimality of Power-of- d Load Balancing in Large-Scale Systems," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1535-1571, November.
    7. Rami Atar & David Lipshutz, 2021. "Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 268-300, February.
    8. Patrick Eschenfeldt & David Gamarnik, 2018. "Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 867-886, August.
    9. Avishai Mandelbaum & Petar Momčilović & Yulia Tseytlin, 2012. "On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers," Management Science, INFORMS, vol. 58(7), pages 1273-1291, July.
    10. Fiona Sloothaak & James Cruise & Seva Shneer & Maria Vlasiou & Bert Zwart, 2021. "Complete resource pooling of a load-balancing policy for a network of battery swapping stations," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 65-120, October.
    11. Cao, Ping & Zhong, Zhiheng & Huang, Junfei, 2021. "Dynamic routing in a distributed parallel many-server service system: The effect of ξ-choice," European Journal of Operational Research, Elsevier, vol. 294(1), pages 219-235.
    12. Arka Ghosh & Keguo Huang, 2017. "Asymptotically optimal control of N-systems with $$H_2^*$$ H 2 ∗ service times under many-server heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 35-60, June.
    13. Matthieu Jonckheere & Balakrishna J. Prabhu, 2018. "Asymptotics of insensitive load balancing and blocking phases," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 243-278, April.
    14. Jayakrishnan Nair & Adam Wierman & Bert Zwart, 2016. "Provisioning of Large-Scale Systems: The Interplay Between Network Effects and Strategic Behavior in the User Base," Management Science, INFORMS, vol. 62(6), pages 1830-1841, June.
    15. Jiekun Feng & Pengyi Shi, 2018. "Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 26-65, February.
    16. Itai Gurvich & Junfei Huang & Avishai Mandelbaum, 2014. "Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 325-373, May.
    17. Leon Cui & Tolga Tezcan, 2016. "Approximations for Chat Service Systems Using Many-Server Diffusion Limits," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 775-807, August.
    18. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    19. Tolga Tezcan & Banafsheh Behzad, 2012. "Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 386-401, July.
    20. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:101:y:2022:i:3:d:10.1007_s11134-022-09847-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.