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

Annals of Applied Probability

Volumn 15, Issue 3, 2005, Pages 1733-1764

  Luczak, Malwina J ^a   McDiarmid, Colin ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b Department of Statistics ^*  (United Kingdom)

Author keywords

Balls and bins; Equilibrium; Immigration death; Load balancing; Maximum load; Power of two choices; Random choices

Indexed keywords

EID: 32144444208     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/105051605000000205     Document Type: Review

References (23)

1. ALON, N. and SPENCER, J. (2000). The Probabilistic Method. Wiley, New York.
2. AZAR, Y., BRODER, A., KARLIN, A. and UPFAL, E. (1994). Balanced allocations. In Proc. 26th ACM Symp. Theory Comp. 593-602.
3. AZAR, Y., BRODER, A., KARLIN, A. and UPFAL, E. (1999). Balanced allocations. SIAM J. Comput. 29 180-200.
4. BEREBRINK, P., CZUMAJ, A., STEGER, A. and VÖCKING, B. (2000). Balanced allocations: The heavily loaded case. In Proc. 32nd ACM Symp. Theory Comp. 745-754.
5. BOUCHERON, S., GAMBOA, F. and LÉONARD, C. (2002). Bins and balls: Large deviations of the empirical occupancy process. Ann. Appl. Probab. 12 607-636.
6. CERCIGNIANI, C. (1988). The Boltzmann Equation and Its Applications. Springer, Berlin.
7. CZUMAJ, A. (1998). Recovery time of dynamic allocation processes. In Proc. 10th Annual ACM Symp. on Parallel Algorithms and Architectures 202-211.
8. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes, Characterization and Convergence. Wiley, New York.
9. GRAHAM, C. (2000). Kinetic limits for large communication networks. In Modelling in Applied Sciences (N. Bellomo and M. Pulvirenti, eds.) 317-370. Birkhäuser, Basel.
10. GRAHAM, C. and MÉLÉARD, S. (1994). Chaos hypothesis for a system interacting through shared resources. Probab. Theory Related Fields 100 157-173.
11. LUCZAK, M. J. and MCDIARMID, C. (2004). On the maximum queue length in the supermarket model. Preprint.
12. LUCZAK, M. J., McDIARMID, C. and UPFAL, E. (2003). On-line routing of random calls in networks. Probab. Theory Related Fields 125 457-482.
13. McDIARMID, C. (1989). On the method of bounded differences. In Surveys in Combinatorics (J. Siemons, ed.) 148-188. London Math. Soc. Lecture Note Ser. 141. Cambridge Univ. Press.
14. McDIARMID, C. (1998). Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez and B. Reed, eds.) 195-248. Springer, Berlin.
15. MITZENMACHER, M. (1996). The power of two choices in randomized load balancing. Ph.D. thesis, Berkeley.
16. MITZENMACHER, M. (1999). Studying balanced allocations with differential equations. Combin. Probab. Comput. 8 473-482.
17. MITZENMACHER, M., RICHA, A. W. and SITARAMAN, R. (2001). The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing 1 (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim, eds.) 255-312. Kluwer, Dordrecht.
18. SZNITMAN, A. S. (1991). Propagation of chaos. Ecole d'Été Saint-Flour 1989. Lecture Notes in Math. 1464 165-251. Springer, Berlin.
19. THOMAS, E. J. (1998). A loss service system with another chance. Part III Essay, Univ. Cambridge.
20. THOMAS, E. J. (2000). Personal communication.
21. TURNER, S. R. E. (1998). The effect of increasing routing choice on resource pooling. Probab. Engrg. Inform. Sci. 12 109-124.
22. VÖCKING, B. (1999). How asymmetry helps load balancing. In Proc. 40th IEEE Symp. Found. Comp. Sci. 131-140. IEEE Comp. Soc. Press, New York.
23. VVEDENSKAYA, N. D., DOBRUSHIN, R. L. and KARPELEVICH, F. I. (1996). Queueing system with selection of the shortest of two queues: An asymptotic approach. Probl Inf. Transm. 32 15-27.