Persistent-Idle Load-Distribution

References

• Andrews M, Kumaran K, Ramanan K, Stolyar A, Vijayakumar R, Whiting P (2004) Scheduling in a queuing system with asynchronously varying service rates. Probab. Engrg. Inform. Sci. 18(2):191–217.Google Scholar
• Asmussen S (2008) Applied Probability and Queues, vol. 51 (Springer Science & Business Media, Berlin).Google Scholar
• Daley D (1987) Certain optimality properties of the first-come first-served discipline for G/G/s queues. Stochastic Process. Appl. 25:301–308.Google Scholar
• Durrett R (2010) Probability: Theory and Examples. (Cambridge University Press, Cambridge, UK).Google Scholar
• Foschini G, Salz J (1978) A basic dynamic routing problem and diffusion. IEEE Trans. Commun. 26(3):320–327.Google Scholar
• Foss S (1982) Extremal problems in queueing theory. PhD thesis, Novosibirsk State University, Novosibirsk, Russia. In Russian.Google Scholar
• Foss S, Chernova N (1998) On the stability of a partially accessible multi-station queue with state-dependent routing. Queueing Syst. 29(1):55–73.Google Scholar
• Georgiadis L, Neely MJ, Tassiulas L (2006) Resource allocation and cross-layer control in wireless networks. Foundations Trends Networking. 1(1):1–144.Google Scholar
• Hajek B (2015) Random Processes for Engineers (Cambridge University Press, Cambridge, UK).Google Scholar
• Koole GM (1992) On the optimality of FCFS for networks of multi-server queues. Working paper, Vrije Universiteit, Amsterdam.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. Perform. Eval. 68(11):1056–1071.Google Scholar
• Malyshev VA, Men’shikov MV (1979) Ergodicity, continuity and analyticity of countable Markov chains. Trudy Moskovskogo Matematicheskogo Obshchestva 39:3–48.Google Scholar
• Meyn SP, Tweedie R (1994) State-dependent criteria for convergence of Markov chains. Ann. Appl. Probab. 4(1):149–168.Google Scholar
• Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Trans. Parallel Distribution Systems 12(10):1094–1104.Google Scholar
• Shah D (2017) Private communication.Google Scholar
• Shah D, Prabhakar B (2002) The use of memory in randomized load balancing. IEEE ISIT Proc. IEEE Internat. Sympos. Inform. Theory 2002, Lausanne, Switzerland, 125.Google Scholar
• Stolyar AL (2015) Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems 80(4):341–361.Google Scholar
• Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automat. Control. 37(12):1936–1948.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 (2013) Stability of maxweight-(α, g). Preprint, submitted January 16, https://arxiv.org/abs/1301.3723.Google Scholar
• Weber RR (1978) On the optimal assignment of customers to parallel servers. J. Appl. Probab. 15(2):406–413.Google Scholar
• Winston W (1977) Optimality of the shortest line discipline. J. Appl. Probab. 14(1):181–189.Google Scholar
• Wolff RW (1987) Upper bounds on work in system for multichannel queues. J. Appl. Probab. 24(2):547–551.Google Scholar