Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics

References

• Anderson RF, Orey S (1976) Small random perturbation of dynamical systems with reflecting boundary. Nagoya Math. J. 60:189–216.Crossref, Google Scholar
• Brightwell G, Luczak M (2012) The supermarket model with arrival rate tending to one. Preprint arXiv:1201.5523.Google Scholar
• Dai JG, Tezcan T (2011) State space collapse in many-server diffusion limits of parallel server systems. Math. Oper. Res. 36(2):271–320.Link, Google Scholar
• Das KM (1979) A note on an inequality due to Greene. Proc. Amer. Math. Soc. 77(3):424–425.Google Scholar
• Dieker AB, Suk T (2015) Randomized longest-queue-first scheduling for large-scale buffered systems. Adv. Appl. Probab. 47(4):1015–1038.Crossref, Google Scholar
• Ethier SN, Kurtz TG (2005) Markov Processes: Characterization and Convergence, Wiley Series in Probability and Statistics (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Fairthorne M (2011) The supermarket model with system-size dependent parameters. PhD thesis, London School of Economics.Google Scholar
• Flatto L, McKean HP (1977) Two queues in parallel. Comm. Pure Appl. Math. 30(2):255–263.Crossref, Google Scholar
• Foschini GJ, Salz J (1978) A basic dynamic routing problem and diffusion. Comm., IEEE Trans. 26(3):320–327.Crossref, Google Scholar
• Greene DE (1977) An inequality for a class of integral systems. Proc. Amer. Math. Soc. 62(1):101–104.Google Scholar
• Haight FA (1958) Two queues in parallel. Biometrika 45(3–4):401–410.Crossref, Google Scholar
• Halfin S (1985) The shortest queue problem. J. Appl. Probab. 22(4):865–878.Crossref, Google Scholar
• Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• Kingman JFC (1961) Two similar queues in parallel. Ann. Math. Statist. 32(4):1314–1323.Crossref, Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. Parallel and Distributed Systems, IEEE Trans. 12(10):1094–1104.Crossref, Google Scholar
• Pang G, Talreja R, Whitt W (2007) Martingale proofs of many-server heavy-traffic limits for Markovian queues. Prob. Surveys 4:193–267.Crossref, Google Scholar
• Ramanan K (2006) Reflected diffusions defined via the extended skorokhod map. Electron. J. Probab. 11:934–992.Crossref, Google Scholar
• Rudin W (2006) The Principles of Mathematical Analysis, International Series in Pure and Applied Mathematics, 3rd ed. (McGraw-Hill, New York).Google Scholar
• Tezcan T (2008) Optimal control of distributed parallel server systems under the Halfin and Whitt regime. Math. Oper. Res. 33(1):51–90.Link, Google Scholar
• Vvedenskaya ND, Dobrushin RL, Karpelevich FI (1996) Queueing system with selection of the shortest of two queues: An asymptotic approach. Probl. Peredachi Inf. 32(1):20–34.Google Scholar
• Weber RR (1978) On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15(2):406–413.Crossref, Google Scholar
• Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues, Springer Series in Operations Research (Springer, New York).Crossref, Google Scholar
• Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Crossref, Google Scholar
• Zhang H, Wang R (1989) Heavy traffic limit theorems for a queueing system in which customers join the shortest line. Adv. Appl. Probab. 21(2):451–469.Crossref, Google Scholar
• Zhang H, Hsu G-H, Wang R (1995) Heavy traffic limit theorems for a sequence of shortest queueing systems. Queueing Systems 21(1–2):217–238.Crossref, Google Scholar