On the power of two choices: Balls and bins in continuous time

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have independent exponential lifetimes with unit mean. We show that the system converges rapidly to its equilibrium distribution; and when d\geq 2, there is an integer-valued function m_d(n)=\ln \ln n/\ln d+O(1) such that, in the equilibrium distribution, the maximum load of a bin is concentrated on the two values m_d(n) and m_d(n)-1, with probability tending to 1, as n\to \infty. We show also that the maximum load usually does not vary by more than a constant amount from \ln \ln n/\ln d, even over quite long periods of time.

[1]  Colin McDiarmid,et al.  On the maximum queue length in the supermarket model , 2004 .

[2]  Berthold Vöcking,et al.  How asymmetry helps load balancing , 1999, JACM.

[3]  M. Habib Probabilistic methods for algorithmic discrete mathematics , 1998 .

[4]  S. Turner,et al.  The Effect of Increasing Routing Choice on Resource Pooling , 1998, Probability in the Engineering and Informational Sciences.

[5]  S. Boucheron,et al.  BINS AND BALLS: LARGE DEVIATIONS OF THE EMPIRICAL OCCUPANCY PROCESS , 2002 .

[6]  R. L. Dobrushin,et al.  Queueing system with selection of the shortest of two queues: an assymptotic approach , 1996 .

[7]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[8]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .

[9]  Carl Graham,et al.  Kinetic Limits for Large Communication Networks , 2000 .

[10]  C. Cercignani The Boltzmann equation and its applications , 1988 .

[11]  Berthold Vöcking,et al.  Balanced allocations: the heavily loaded case , 2000, STOC '00.

[12]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[13]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[14]  Eli Upfal,et al.  On-line routing of random calls in networks , 2003 .

[15]  C. McDiarmid Concentration , 1862, The Dental register.

[16]  Ramesh K. Sitaraman,et al.  The power of two random choices: a survey of tech-niques and results , 2001 .

[17]  C. Graham,et al.  Chaos hypothesis for a system interacting through shared resources , 1994 .

[18]  Pierre Del Moral Propagation of Chaos , 2004 .

[19]  Michael Mitzenmacher,et al.  Studying Balanced Allocations with Differential Equations , 1999, Combinatorics, Probability and Computing.

[20]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.