Self-Learning Threshold-Based Load Balancing

References

• Baccelli F, Kauffmann B, Veitch D (2009) Inverse problems in queueing theory and internet probing. Queueing Systems 63:59.Crossref, Google Scholar
• Badonnel R, Burgess M (2008) Dynamic pull-based load balancing for autonomic servers. Proc. 2008 IEEE Network Oper. Management Sympos. (IEEE, Piscataway, NJ), 751–754.Google Scholar
• Benameur N, Fredj SB, Oueslati-Boulahia S, Roberts JW (2002) Quality of service and flow level admission control in the Internet. Comput. Networks 40(1):57–71.Crossref, Google Scholar
• Billingsley P (2013) Convergence of Probability Measures (Wiley, New York).Google Scholar
• Bonald T, Jonckheere M, Proutière A (2004) Insensitive load balancing. ACM SIGMETRICS Performance Evaluation Rev. 32(1):367–377.Crossref, Google Scholar
• Bramson M (1998) State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30(1-2):89–140.Crossref, Google Scholar
• Comte C (2019) Dynamic load balancing with tokens. Comput. Commun. 144:76–88.Crossref, Google Scholar
• Defraeye M, Van Nieuwenhuyse I (2016) Staffing and scheduling under nonstationary demand for service: A literature review. Omega 58:4–25.Crossref, Google Scholar
• Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans. Automatic Control 25(4):690–693.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
• Goldsztajn D, Ferragut A, Paganini F (2018a) Feedback control of server instances for right sizing in the cloud. Proc. 56th Annual Allerton Conf. Comm. Control Comput. (IEEE, Piscataway, NJ), 749–756.Google Scholar
• Goldsztajn D, Ferragut A, Paganini F, Jonckheere M (2018b) Controlling the number of active instances in a cloud environment. ACM SIGMETRICS Performance Evaluation Rev. 45(3):15–20.Crossref, Google Scholar
• Gupta V, Harchol-Balter M (2009) Self-adaptive admission control policies for resource-sharing systems. ACM SIGMETRICS Performance Evaluation Rev. 37(1):311–322.Crossref, Google Scholar
• Horváth IA, Scully Z, Van Houdt B (2019) Mean field analysis of join-below-threshold load balancing for resource sharing servers. Proc. ACM Measurement Anal. Comput. Systems 3(3):57.Google Scholar
• Jonckheere M, Prabhu BJ (2016) Asymptotics of insensitive load balancing and blocking phases. Proc. 2016 ACM SIGMETRICS Internat. Conf. Measurement Modeling Comput. Sci. (ACM, New York), 311–322.Google Scholar
• Karthik A, Mukhopadhyay A, Mazumdar RR (2017) Choosing among heterogeneous server clouds. Queueing Systems 85:1–29.Crossref, Google Scholar
• Key P, Massoulié L, Bain A, Kelly F (2004) Fair internet traffic integration: Network flow models and analysis. Ann. Télécomm. 59:1338–1352.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
• Menich R, Serfozo RF (1991) Optimality of routing and servicing in dependent parallel processing systems. Queueing Systems 9(4):403–418.Crossref, Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans. Parallel Distributed Systems 12(10):1094–1104.Crossref, Google Scholar
• Mukherjee D, Borst SC, Van Leeuwaarden JS, Whiting PA (2016) Universality of load balancing schemes on the diffusion scale. J. Appl. Probab. 53(4):1111–1124.Crossref, Google Scholar
• Mukherjee D, Borst SC, Van Leeuwaarden JS, Whiting PA (2020) Asymptotic optimality of power-of-d load balancing in large-scale systems. Math. Oper. Res. 45(4):1535–1571.Link, Google Scholar
• Mukherjee D, Dhara S, Borst SC, Van Leeuwaarden JS (2017) Optimal service elasticity in large-scale distributed systems. Proc. ACM Measurement Anal. Comput. Systems 1(1):25.Google Scholar
• Mukhopadhyay A, Mazumdar RR, Guillemin F (2015a) The power of randomized routing in heterogeneous loss systems. Proc. 27th Internat. Teletraffic Congress (IEEE, Piscataway, NJ), 125–133.Google Scholar
• Mukhopadhyay A, Karthik A, Mazumdar RR, Guillemin F (2015b) Mean field and propagation of chaos in multi-class heterogeneous loss models. Performance Evaluation 91:117–131.Crossref, Google Scholar
• Sparaggis PD, Towsley D, Cassandras C (1993) Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates. J. Appl. Probab. 30(1):223–236.Crossref, Google Scholar
• Stolyar AL (2015) Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems 80(4):341–361.Crossref, Google Scholar
• Turner SR (1998) The effect of increasing routing choice on resource pooling. Probab. Engrg. Inform. Sci. 12(1):109–124.Crossref, Google Scholar
• Van der Boor M, Borst SC, Van Leeuwaarden JS, Mukherjee D (2018) Scalable load balancing in networked systems: A survey of recent advances. Preprint, submitted June 14, https://arxiv.org/abs/1806.05444.Google Scholar
• Vvedenskaya ND, Dobrushin RL, Karpelevich FI (1996) Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Inform. 32(1):20–34.Google Scholar
• Wierman A, Andrew LL, Tang A (2012) Power-aware speed scaling in processor sharing systems: Optimality and robustness. Performance Evaluation 69(12):601–622.Crossref, Google Scholar
• Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Crossref, Google Scholar
• Xie Q, Dong X, Lu Y, Srikant R (2015) Power of d choices for large-scale bin packing: A loss model. ACM SIGMETRICS Performance Evaluation Rev. 43(1):321–334.Crossref, Google Scholar
• Yao F, Demers A, Shenker S (1995) A scheduling model for reduced CPU energy. Proc. 36th Annual IEEE Sympos. Foundations Computer Sci. (IEEE, Piscataway, NJ), 374–382.Google Scholar
• Zhou X, Tan J, Shroff N (2019) Heavy-traffic delay optimality in pull-based load balancing systems: Necessary and sufficient conditions. ACM SIGMETRICS Performance Evaluation Rev. 47(1):5–6.Crossref, Google Scholar
• Zhou X, Wu F, Tan J, Sun Y, Shroff N (2017) Designing low-complexity heavy-traffic delay-optimal load balancing schemes: Theory to algorithms. Proc. ACM Measurement Anal. Comput. Systems 1(2):39.Google Scholar