On the maximum queue length in the supermarket model

Annals of Probability

Volumn 34, Issue 2, 2006, Pages 493-527

  Luczak, Malwina J ^a   Mcdiarmid, Colin ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Concentration of measure; Equilibrium; Join the shortest queue; Load balancing; Maximum queue length; Power of two choices; Random choices; Supermarket model

Indexed keywords

EID: 33745033128     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/00911790500000710     Document Type: Article

References (17)

1. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York. MR0838085
2. GRAHAM, C. (2000). Kinetic limits for large communication networks. In Modelling in Applied Sciences (N. Bellomo and M. Pulvirenti, eds.) 317-370. Birkhäuser, Boston. MR1763158
3. GRAHAM, C. (2000). Chaoticity on path space for a queueing network with selection of the shortest queue among several. J. Appl. Probab. 37 198-201. MR 1761670
4. GRAHAM, C. (2004). Functional central limit theorems for a large network in which customers join the shortest of several queues. Probab. Theory Related Fields 131 97-120. MR2105045
5. GRIMMETT, G. R. and STIRZAKER, D. R. (2001). Probability and Random Processes, 3rd ed. Oxford Univ. Press. MR2059709
6. LUCZAK, M. J. (2003). A quantitative law of large numbers via exponential martingales. In Stochastic Inequalities and Applications (E. Giné, C. Houdré and D. Nualart, eds.) 93-111. Birkhäuser, Basel. MR2073429
7. LUCZAK, M. J. and MCDIARMID, C. (2005). On the power of two choices: Balls and bins in continuous time. Ann. Appl. Probab. 15 1733-1764. MR2152243
8. LUCZAK, M. J. and MCDIARMID, C. (2005). Asymptotic distributions and chaos for the supermarket model. Unpublished manuscript.
9. LUCZAK, M. J. and MCDIARMID, C. (2005). Balls and bins in continuous time: Long-term asymptotics and chaos. Unpublished manuscript.
10. LUCZAK, M. J. and NORRIS, J. R. (2004). Strong approximation for the supermarket model. Ann. Appl. Probab. 15 2038-2061. MR2152252
11. MARTIN, J. B. and SUHOV, Y. M. (1999). Fast Jackson networks. Ann. Appl. Probab. 9 854-870. MR 1722285
12. 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. MR 1678578
13. MITZENMACHER, M. (1996). Load balancing and density dependent jump Markov processes. In Proc. 37th Ann. Symp. Found. Comp. Sci. 213-222. IEEE Comput. Soc. Press, Los Alamitos, CA. MR1450619
14. MITZENMACHER, M. (1996). The power of two choices in randomized load-balancing, Ph.D. dissertation, Berkeley.
15. 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 (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim, eds.) 1 255-312. Kluwer, Dordrecht. MR1966907
16. TURNER, S. R. E. (1998). The effect of increasing routing choice on resource pooling. Probab. Engrg. Inform. Sci. 12 109-124. MR1492143
17. VVEDENSKAYA, N. D., DOBRUSHIN, R. L. and KARPELEVICH, F. I. (1996). Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems Inform. Transmission 32 15-27. MR1384927