Load balancing via random local search in closed and open systems

Performance Evaluation Review

Volumn 38, Issue 1 SPEC. ISSUE, 2010, Pages 287-297

  Ganesh, Ayalvadi ^a   Lilienthal, Sarah ^b   Manjunath, D ^c   Proutiere, Alexandre ^d   Simatos, Florian ^e  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^d MICROSOFT RESEARCH   (United Kingdom)

^e INRIA ROCQUENCOURT   (France)

Author keywords

Mean field asymptotics; Queueing theory; Stability analysis

Indexed keywords

ASYMPTOTICS; CLOSED SYSTEMS; JOIN-THE-SHORTEST-QUEUE; LOAD-BALANCING; LOCAL SEARCH; MEAN FIELD; MIGRATION STRATEGY; PARALLEL SERVERS; RANDOM LOAD; RESAMPLING; SERVER LOADS; SERVER SELECTION; SERVICE RATES; SOJOURN TIME; SPECTRUM SHARING; STABILITY ANALYSIS; SYSTEM DYNAMICS;

ASYMPTOTIC ANALYSIS; GAME THEORY; OPEN SYSTEMS; OPERATIONS RESEARCH; PARALLEL ARCHITECTURES; QUEUEING THEORY; SERVERS;

SYSTEM STABILITY;

EID: 77954919612     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1811099.1811072     Document Type: Conference Paper

References (22)

1. IEEE Conference on Dynamic Spectrum Access. http://www.ieee-dyspan.org/.
2. D. Anshelevich and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. SIAM Journal on Computing, 37(5):1656-1673, 2008.
3. P. Berenbrink, T. Friedetzky, and L. A. Goldberg. The natural work-stealing algorithm is stable. SIAM Journal of Computing, 32(5):1260-1279, 2003.
4. P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu, and R. Martin. Distributed selfish load balancing. In Proc. of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 354-363, 2006.
5. P. Berenbrink, T. Friedetzky, I. Hajirasouliha, and Z. Hu. Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks, volume 4698/2007 of LNCS, pages 41-52. Springer Berlin/Heidelberg, September 2007.
6. C. Bordenave, D. McDonald, and A. Proutiere. A particle system in interaction with a rapidly varying environment: Mean field limits and applications. AMS Journal on Networks and Heterogeneous Media, to appear (available on arxiv), 2010.
7. S. Borst, A. Proutiere, and N. Hegde. Capacity of wireless data networks with intra- and inter-cell mobility. In Proc. of IEEE INFOCOM, Barcelona, Spain, 2006.
8. J. G. Dai. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability, 5:49-77, 1995.
9. S. Ethier and T. Kurtz. Markov processes. Wiley, 1986.
10. E. Even-Dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibrium in load balancing. ACM Trans. on Algorithms, 3(3), 2007.
11. R. Feldmann, M. Gairing, T. Lucking, F. B. Monien, and M. Rode. Nashification and the coordination ratio for a selfish routing game. In Proc. of the 30th International Colloquium on Automata, Languages, and Programming (ICALP), 2003.
12. P. W. Goldberg. Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In Proc. of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pages 131-140, 2004.
13. C. Graham. Chaoticity on path space for a queueing network with selection of the shortest queue among several. Journal of Applied Probability, 37:198-211, 2000.
14. M. Harchol-Balter. Task assignment with unknown duration. Journal of the ACM, 49(2):260-288, 2002.
15. P. Key, L. Massoulie, and D. Towsley. Path selection and multipath congestion control. In Proc. of IEEE INFOCOM, 2006.
16. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In Proc. of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 404-413., 1999.
17. M. Mitzenmacher. The power of two choices in randomized load balancing. PhD thesis, University of California Berkely, 1996.
18. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.
19. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multi-user communication networks. IEEE/ACM Transactions on Networking, 1:510-521, 1993.
20. P. Robert. Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series. Springer-Verlag, New York, 2003.
21. F. Simatos and D. Tibi. Spatial homogenization in a stochastic network with mobility. The Annals of Applied Probability, to appear, 2009.
22. A. Sznitman. Propagation of chaos. In: Ecole d'ete de probabilites de Saint Flour XIX, Springer Lectures Notes in Mathematics, 1464:165-251, 1991.