Open Problem—Load Balancing Using Delayed Information

References

• Atar, R Keslassy I, Mendelson G, Orda A, Vargaftik S (2019a) On the persistent-idle load distribution policy under batch arrivals and random service capacity. Technion Technical Report.Google Scholar
• Atar, R Keslassy I, Mendelson G, Orda A, Vargaftik S (2019b) Persistent-idle load-distribution. Technion Technical Report.Google Scholar
• Atar R, Lipshutz D (2018) Heavy traffic limits for join the shortest estimated queue policy using delayed information. Technion Technical Report.Google Scholar
• Badonnel R, Burgess M (2008) Dynamic pull-based load balancing for autonomic servers. Brunner M, Westphall CB, Granville LZ, eds. NOMS 2008–2008 IEEE Network Oper. Management Sympos. (IEEE, Piscataway, NJ), 751–754.Google Scholar
• Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans. Automatic Control 25(4):690–693.Google Scholar
• Kinnally M, Williams RJ (2010) On existence and uniqueness of stationary distributions for stochastic delay differential equations with positivity constraints. Electronic J. Probab. 15(15):409–451.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.Google Scholar
• Mitzenmacher M (2000) How useful is old information? IEEE Trans. Parallel Distributed Systems 11(1):6–20.Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans. Parallel Distributed Systems 12(10):1094–1104.Google Scholar
• Novitzky S, Pender J, Rand R, Wesson E (2019a) Limiting the oscillations in queues with delayed information through a novel type of delay announcement. Preprint, submitted February 20, https://arxiv.org/abs/1902.07617.Google Scholar
• Novitzky S, Pender J, Rand RH, Wesson E (2019b) Nonlinear dynamics in queueing theory: Determining the size of oscillations in queues with delay. SIAM J. Appl. Dynamical Systems 18(1):279–311.Google Scholar
• Pender J, Rand RH, Wesson E (2017) Queues with choice via delay differential equations. Internat. J. Bifurcation Chaos 27(4), https://doi.org/10.1142/S0218127417300166.Google Scholar
• Pender J, Rand RH, Wesson E (2018) An analysis of queues with delayed information and time-varying arrival rates. Nonlinear Dynamics 91(4):2411–2427.Google Scholar
• Reiman MI (1984) Some diffusion approximations with state space collapse. Baccelli F, Fayolle G, eds. Modelling and Performance Evaluation Methodology, Lecture Notes in Control and Information Sciences, vol. 60 (Springer, Berlin, Heidelberg), 207–240.Google Scholar
• van der Boor M, Borst SC, van Leeuwaarden JSH (2019) Hyper-scalable JSQ with sparse feedback. 2019 SIGMETRICS/Performance Joint Internat. Conf. Measurement Modeling Comp. Systems (ACM, New York), 61–62.Google Scholar
• van der Boor M, Borst SC, van Leeuwaarden JSH, 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. Problems Inform Transmission 32(1):20–34.Google Scholar
• Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Google Scholar