The Power of Slightly More than One Sample in Randomized Load Balancing

References

• Anantharam V, Benchekroun M (1993) A technique for computing sojourn times in large networks of interacting queues. Probab. Engrg. Informational Sci. 7(4):441–464.Crossref, Google Scholar
• Billingsley P (1971) Weak Convergence of Measures: Applications in Probability (SIAM, Philadelphia).Crossref, Google Scholar
• Bramson M, Lu Y, Prabhakar B (2012) Asymptotic independence of queues under randomized load balancing. Queueing Systems 71(3):247–292.Crossref, Google Scholar
• Bramson M, Lu Y, Prabhakar B (2013) Decay of tails at equilibrium for FIFO join the shortest queue networks. Ann. Appl. Probab. 23(5):1841–1878.Crossref, Google Scholar
• Draief M, Massoulie L (2010) Epidemics and Rumours in Complex Networks (Cambridge University Press, Cambridge, UK).Google Scholar
• Eryilmaz A, Srikant R (2012) Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems 72(3–4):311–359.Crossref, Google Scholar
• Khalil HK (2001) Nonlinear Systems (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Kurtz TG (1981) Approximation of Population Processes, Vol. 36 (SIAM, Philadelphia).Crossref, Google Scholar
• Mitzenmacher M (1996) Load balancing and density dependent jump Markov processes. Proc., 37th Annual Sympos. Foundations Comput. Sci., ’96 (IEEE Computer Society, Washington, DC), 213–222.Crossref, Google Scholar
• Mitzenmacher M (1996) The power of two choices in randomized load balancing. Ph.D. thesis, University of California at Berkeley.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
• Mukhopadhyay A, Mazumdar RR (2013) Analysis of load balancing in large heterogeneous processor sharing systems. arXiv preprint arXiv:1311.5806.Google Scholar
• Ousterhout K, Wendell P, Zaharia M, Stoica I (2013) Sparrow: Distributed, low latency scheduling. Kaminsky M, Dahlin M, eds. Proc. 24th ACM Sympos. Operating Systems Principles, SOSP ’13 (ACM, New York), 69–84.Crossref, Google Scholar
• Richa A, Mitzenmacher M, Sitaraman R (2001) The power of two random choices: A survey of techniques and results. Combinatorial Optim. 9:255–304.Crossref, Google Scholar
• Srikant R, Ying L (2014) Communication Networks: An Optimization, Control and Stochastic Networks Perspective (Cambridge University Press, Cambridge, UK).Google Scholar
• Sznitman A-S (1991) Topics in propagation of chaos. Hennequin P-L, ed. Ecole d’été de probabilités de Saint-Flour XIX’1989 (Springer, Berlin), 165–251.Crossref, Google Scholar
• Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stochastic Systems 2(1):1–66.Link, Google Scholar
• Tsitsiklis JN, Xu K (2013) Queueing system topologies with limited flexibility. Harchol-Balter M, Douceur JR, Xu J, eds. Proc. ACM SIGMETRICS/Internat. Conf. Measurement and Modeling Comput. Systems, SIGMETRICS ’13 (ACM, New York), 167–178.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