Rates of convergence of the join the shortest queue policy for large-system heavy traffic

1. Banerjee, S., Mukherjee, D.: Join-the-shortest queue diffusion limit in Halfin-Whitt regime: tail asymptotics and scaling of extrema. Ann. Appl. Probab. 29(2), 1262–1309 (2019)

   Article  Google Scholar 

2. Banerjee, S., Mukherjee, D.: Join-the-shortest queue diffusion limit in Halfin-Whitt regime: sensitivity on the heavy traffic parameter. Ann. Appl. Probab. 30(1), 80–144 (2020)

   Article  Google Scholar 

3. Braverman, A.: Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime. Math. Oper. Res. 45(3), 1069–1103 (2020)

   Article  Google Scholar 

4. Braverman, A.: The prelimit generator comparison approach of Stein’s method. Stoch. Syst., (2021)

5. Braverman, A.: Join the shortest queue in the Halfin-Whitt regime: Rates of convergence to the diffusion limit. (2022)

6. Braverman, A., Dai, J.G., Feng, J.: Stein’s method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models. Stoch. Syst. 6(2), 301–366 (2016)

   Article  Google Scholar 

7. Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. Elsevier, Amsterdam (1983)

   Google Scholar 

8. Ephremides, A., Varaiya, P., Walrand, J.: A simple dynamic routing problem. IEEE Trans. Autom. Control 25(4), 690–693 (1980)

   Article  Google Scholar 

9. Eschenfeldt, P., Gamarnik, D.: Join the shortest queue with many servers. The heavy traffic-asymptotics. Math. Oper. Res. 43(3), 867–886 (2018)

   Article  Google Scholar 

10. Gupta, V., Harchol-Balter, M., Sigman, K., Whitt, W.: Analysis of join-the-shortest-queue routing for web server farms. Perform. Eval. 64(9–12), 1062–1081 (2007)

    Article  Google Scholar 

11. Gupta, V., Walton, N.: Load balancing in the nondegenerate slowdown regime. Oper. Res. 67(1), 281–294 (2019)

    Article  Google Scholar 

12. Gurvich, I.: Diffusion models and steady-state approximations for exponentially ergodic Markovian queues. Ann. Appl. Probab. 24(6), 2527–2559 (2014)

    Article  Google Scholar 

13. Haight, F.A.: Two queues in parallel. Biometrika 45(3–4), 401–410 (1958)

    Article  Google Scholar 

14. Huang, J., Gurvich, I.: Beyond heavy-traffic regimes: universal bounds and controls for the single-server queue. Oper. Res. 66(4), 1168–1188 (2018)

    Article  Google Scholar 

15. Hurtado-Lange, D., Maguluri, S. T.: Load balancing system under join the shortest queue: Many-server-heavy-traffic asymptotics. arXiv:2004.04826, (2020)

16. Kingman, J.F.C.: Two similar queues in parallel. Ann. Math. Stat. 32(4), 1314–1323 (1961)

    Article  Google Scholar 

17. Liu, X., Ying, L.: A simple steady-state analysis of load balancing algorithms in the sub-Halfin-Whitt regime. ACM SIGMETRICS Perform. Eval. Rev. 46(2), 15–17 (2019)

    Article  Google Scholar 

18. Mukherjee, D., Borst, S.C., van Leeuwaarden, J.S.H., Whiting, P.A.: Universality of power-of-d load balancing in many-server systems. Stoch. Syst. 8(4), 265–292 (2018)

    Article  Google Scholar 

19. Winston, W.: Optimality of the shortest line discipline. J. Appl. Probab. 14(1), 181–189 (1977)

    Article  Google Scholar 

20. Zhao, Z., Banerjee, S., Mukherjee, D.: Many-server asymptotics for Join-the-Shortest Queue in the super-Halfin-Whitt scaling window. (2021)

Download references