Load Balancing Using Sparse Communication

References

• Atar R, Keslassy I, Mendelson G (2019) Subdiffusive load balancing in time-varying queueing systems. Oper. Res. 67(6):1678–1698.Link, Google Scholar
• Atar R, Keslassy I, Mendelson G, Orda A, Vargaftik S (2020) Persistent-idle load-distribution. Stochastic Systems 10(2):152–169.Link, Google Scholar
• Chen H, Yao DD (2001) Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization, Stochastic Modelling and Applied Probability, vol. 46 (Springer, New York).Crossref, Google Scholar
• Downs C (2024) Small business servers: How to choose best server in 2024. Accessed April 15, 2024, https://blog.servermania.com/choosing-a-small-business-server#Step_3_Calculate_Your_Business_Servers_Budget.Google Scholar
• Durrett R (2019) Probability: Theory and Examples, 5th ed. (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans. Automation Control 25(4):690–693.Crossref, Google Scholar
• Foschini G, Salz J (1978) A basic dynamic routing problem and diffusion. IEEE Trans. Comm. 26(3):320–327.Crossref, Google Scholar
• Foss S, Stolyar AL (2017) Large-scale join-idle-queue system with general service times. J. Appl. Probab. 54(4):995–1007.Crossref, Google Scholar
• Gamarnik D, Tsitsiklis JN, Zubeldia M (2018) Delay, memory, and messaging tradeoffs in distributed service systems. Stochastic Systems 8(1):45–74.Link, Google Scholar
• Grimmett G, Stirzaker D (2020) Probability and Random Processes (Oxford University Press, Oxford, UK).Google Scholar
• Haight FA (1958) Two queues in parallel. Biometrika 45(3–4):401–410.Crossref, Google Scholar
• Hubspot (2024) How many visitors should your website get? Accessed April 15, 2024, https://blog.hubspot.com/blog/tabid/6307/bid/5092/how-many-visitors-should-your-site-get.aspx.Google Scholar
• Kingman JF (1961) Two similar queues in parallel. Ann. Math. Statist. 32(4):1314–1323.Crossref, Google Scholar
• Liu Z, Towsley D (1994) Optimality of the round-robin routing policy. J. Appl. Probab. 31(2):466–475.Crossref, Google Scholar
• Lu Y, Xie Q, Kliot G, Geller A, Larus JR, Greenberg A (2011) Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services. Performance Evaluation 68(11):1056–1071.Crossref, Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans. Parallel Distribution Systems 12(10):1094–1104.Crossref, Google Scholar
• Mitzenmacher M (2016) Analyzing distributed join-idle-queue: A fluid limit approach. 2016 54th Annual Allerton Conf. Comm. Control Comput. (Allerton) (IEEE, Piscataway, NJ), 312–318.Google Scholar
• Mitzenmacher M, Prabhakar B, Shah D (2002) Load balancing with memory. 43rd Annual IEEE Sympos. Foundations Comput. Sci., 2002. Proc. (IEEE, Piscataway, NJ), 799–808.Google Scholar
• Shah D, Prabhakar B (2002) The use of memory in randomized load balancing. Proc. IEEE Internat. Sympos. Inform. Theory (IEEE, Piscataway, NJ), 125.Google Scholar
• Stolyar AL (2015) Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems 80(4):341–361.Crossref, Google Scholar
• Tsitsiklis JN, Xu K (2013) On the power of (even a little) resource pooling. Stochastic Systems 2(1):1–66.Link, Google Scholar
• van der Boor M, Borst S, van Leeuwaarden J (2019) Hyper-scalable JSQ with sparse feedback. Proc. ACM Measurement Anal. Comput. Systems 3(1):1–37.Crossref, Google Scholar
• Vargaftik S, Keslassy I, Orda A (2020) LSQ: Load balancing in large-scale heterogeneous systems with multiple dispatchers. IEEE/ACM Trans. Networking 28(3):1186–1198.Crossref, Google Scholar
• Vvedenskaya ND, Dobrushin RL, Karpelevich FI (1996) Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Informatsii 32(1):20–34.Google Scholar
• Walton N, Xu K (2021) Learning and information in stochastic networks and queues. Tutorials in Operations Research: Emerging Optimization Methods and Modeling Techniques with Applications (INFORMS, Catonsville, MD), 161–198.Link, Google Scholar
• Weber RR (1978) On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15(2):406–413.Crossref, Google Scholar
• Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Crossref, Google Scholar
• Xu K, Zhong Y (2020) Information and memory in dynamic resource allocation. Oper. Res. 68(6):1698–1715.Link, Google Scholar
• Zhou X, Shroff N, Wierman A (2021) Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers. Performance Evaluation 145:102146.Crossref, Google Scholar