Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes

References

• [1] Billingsley P (1986) Probability and Measure, 2nd ed. (John Wiley and Sons, New York).Google Scholar
• [2] Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems Theory Appl. 30:89–148.Crossref, Google Scholar
• [3] Bramson M, Dai JG (2001) Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11(1):49–90.Crossref, Google Scholar
• [4] Braverman A, Dai JG (2017) Stein’s method for steady-state diffusion approximations of M/Ph/n + M systems. Ann. Appl. Probab. 27(1):550–581.Crossref, Google Scholar
• [5] Braverman A, Dai JG, Feng J (2016) Stein’s method for steady-state diffusion approximations: An introduction through the Erlang-A and Erlang-C models. Stochastic Systems 6(2):301–366.Link, Google Scholar
• [6] Cao P, He S, Huang J, Liu Y (2021) To pool or not to pool: Queueing design for large-scale service systems. Oper. Res. 69(6):1866–1885.Link, Google Scholar
• [7] Dai JG, He S (2010) Customer abandonment in many-server queues. Math. Oper. Res. 35(2):347–362.Link, Google Scholar
• [8] Dai JG, He S (2012) Many-server queues with customer abandonment: A survey of diffusion and fluid approximations. J. Systems Sci. Systems Engrg. 21(1):1–36.Crossref, Google Scholar
• [9] Dai JG, He S, Tezcan T (2010) Many-server diffusion limits for G/Ph/n + GI queues. Ann. Appl. Probab. 20(5):1854–1890.Crossref, Google Scholar
• [10] Einav Y (2023) Amazon found every 100ms of latency cost them 1% in sales. GigaSpaces (July 26), https://www.gigaspaces.com/blog/amazon-found-every-100ms-of-latency-cost-them-1-in-sales/.Google Scholar
• [11] Eryilmaz A, Srikant R (2012) Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems 72(3–4):311–359. ISSN 0257-0130.Crossref, Google Scholar
• [12] Eschenfeldt P, Gamarnik D (2018) Join the shortest queue with many servers. The heavy-traffic asymptotics. Math. Oper. Res. 43(3):867–886.Link, Google Scholar
• [13] Ferragut A, Paganini F (2012) Content dynamics in P2P networks from queueing and fluid perspectives. 2012 24th Internat. Teletraffic Congress (ITC 24) (IEEE, Piscataway, NJ), 1–8.Google Scholar
• [14] Foschini G, Salz J (1978) A basic dynamic routing problem and diffusion. IEEE Trans. Comm. 26(3):320–327.Crossref, Google Scholar
• [15] Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208–227.Link, Google Scholar
• [16] Hajek B (1982) Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab. 14(3):502–525.Crossref, Google Scholar
• [17] Harrison JM (1978) The diffusion approximation for tandem queues in heavy traffic. Adv. Appl. Probab. 10(4):886–905.Crossref, Google Scholar
• [18] Hurtado-Lange D, Maguluri ST (2020) Transform methods for heavy-traffic analysis. Stochastic Systems 10(4):275–309.Link, Google Scholar
• [19] Jhunjhunwala P, Maguluri ST (2023) Heavy traffic distribution of queueing systems without resource pooling. Preprint, submitted September 15, http://dx.doi.org/10.48550/ARXIV.2206.06504.Google Scholar
• [20] Kang W, Ramanan K (2010) Fluid limits of many-server queues with reneging. Ann. Appl. Probab. 20(6):2204–2260.Crossref, Google Scholar
• [21] Khiyaita A, El Bakkali H, Zbakh M, El Kettani D (2012) Load balancing cloud computing: State of art. 2012 National Days Network Security Systems (IEEE), 106–109.Google Scholar
• [22] Kingman JFC (1961) The single server queue in heavy traffic. Math. Proc. Cambridge Philos. Soc. 57(4):902–904.Crossref, Google Scholar
• [23] Kingman JFC (1962) On queues in heavy traffic. J. Roy. Statist. Soc. Ser. B Methodological 24(2):383–392.Crossref, Google Scholar
• [24] Koole G, Mandelbaum A (2002) Queueing models of call centers: An introduction. Ann. Oper. Res. 113(1/4):41–59. Crossref, Google Scholar
• [25] Mörters P, Peres Y (2010) Brownian Motion, vol. 30 (Cambridge University Press, Cambridge, UK).Google Scholar
• [26] Nahmias S (1982) Perishable inventory theory: A review. Oper. Res. 30(4):680–708.Link, Google Scholar
• [27] Reed JE, Ward AR (2008) Approximating the GI/GI/1 + GI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33(3):606–644.Link, Google Scholar
• [28] Reiman MI (2005) Some diffusion approximations with state space collapse. Modelling and Performance Evaluation Methodology: Proceedings of the International Seminar Paris, France, January 24–26, 1983 (Springer, Berlin, Heidelberg), 207–240.Google Scholar
• [29] Schlosshauer M (2019) Quantum decoherence. Phys. Rep. 831:1–57.Crossref, Google Scholar
• [30] Uhlenbeck GE, Ornstein LS (1930) On the theory of the Brownian motion. Phys. Rev. 36(5):823.Crossref, Google Scholar
• [31] Vardoyan G, Guha S, Nain P, Towsley D (2019) On the capacity region of bipartite and tripartite entanglement switching. Preprint, submitted April 9, https://arxiv.org/abs/1901.06786v2.Google Scholar
• [32] Varma SM, Maguluri ST (2022) A heavy traffic theory of two-sided queues. ACM SIGMETRICS Performance Evaluation Rev. 49(3):43–44.Google Scholar
• [33] Ward AR, Glynn PW (2003) A diffusion approximation for a Markovian queue with reneging. Queueing Systems 43(1/2):103–128. Crossref, Google Scholar
• [34] Ward AR, Glynn PW (2005) A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Systems 50(4):371–400.Crossref, Google Scholar
• [35] Williams RJ (1998) Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems Theory Appl. 30:27–88. Crossref, Google Scholar
• [36] Williams RJ (2016) Stochastic processing networks. Annual Rev. Statist. Appl. 3(1):323–345.Crossref, Google Scholar
• [37] Yurke B, Denker JS (1984) Quantum network theory. Phys. Rev. A 29(3):1419.Crossref, Google Scholar
• [38] Zeltyn S, Mandelbaum A (2005) Call centers with impatient customers: Many-server asymptotics of the M/M/n + G queue. Queueing Systems 51(3–4):361–402.Crossref, Google Scholar