Distributed selfish load balancing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 354-363

  Berenbrink, Petra ^a   Friedetzky, Tom ^b   Goldberg, Leslie Ann ^c   Goldberg, Paul ^c   Hu, Zengjian ^a   Martin, Russell ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AGENTS; APPROXIMATION THEORY; GAME THEORY; PRECISION BALANCES; SET THEORY; TIME SERIES ANALYSIS;

CENTRAL CONTROL; LOAD BALANCING; NATURAL PROTOCOL;

ALGORITHMS;

EID: 33244473024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109597     Document Type: Conference Paper

References (16)

1. A. Czumaj. Recovery Time of Dynamic Allocation Processes. Proc. 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Puerto Vallarta, Mexico (1998), pp. 202-211.
2. A. Czumaj, P. Krysta and B. Vöcking. Selfish Traffic Allocation for Server Farms. Proc. 34th Annual Symposium on Theory of Computing (STOC), Montreal, Canada (2002), pp. 287-296.
3. A. Czumaj, C. Riley and C. Scheideler. Perfectly Balanced Allocation. Proc. 7th Annual International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX), Princeton, NJ (2003), pp. 240-251.
4. A. Czumaj and B. Vöcking. Tight Bounds for Worst-Case Equilibria. Proc. 13th Annual Symposium on Discrete Algorithms, SIAM, Philadelphia, PA (2002), pp. 413-420.
5. E. Even-Dar, A. Kesselman and Y. Mansour. Convergence Time to Nash Equilibria. Proc. of the 30th International Colloquium on Automata, Languages and Programming (ICALP), Eindhoven, Netherlands (2003), pp. 502-513.
6. E. Even-Dar and Y. Mansour. Fast Convergence of Selfish Rerouting. Proc. of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, British Columbia (2005), pp. 772-781.
7. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P. Spirakis. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. Proc. of the 29th International Colloquium on Automata, Languages, and Programming (ICALP), Malaga, Spain (2002), pp. 123-134.
8. P. Goldberg. Bounds for the Convergence Rate of Randomized Local Search in a Multiplayer Load-balancing Game Proc. of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), St. John's, Newfoundland (2004), pp. 131-140.
9. T. Hagerup and C. Rüb. A Guided Tour of Chernov Bounds. Information Processing Letters 33 (1989), pp. 305-308.
10. E. Koutsoupias and C.H. Papadimitriou. Worst-Case Equilibria. Proc. I6th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Trier, Germany (1999), pp. 404-413.
11. M. Luby, D. Randall and A.J. Sinclair. Markov chain algorithms for planar lattice structures. SIAM Journal on Computing 31 (2001), pp. 167-192.
12. M. Mavronicolas and P. Spirakis. The Price of Selfish Routing. Proc. 33rd Annual Symposium on Theory of Computing (STOC), Crete, Greece (2001), pp. 510-519.
13. M. Mitzenmacher, A. Richa and R. Sitaraman. The power of two random choices: A survey of the techniques and results. In Handbook of Randomized Computing, P. Pardalos, S. Rajasekaran, and J. Rolim (eds), Kluwer (2000), pp. 255-312.
14. T. Roughgarden. Many papers studying the cost of selfish routing in the flow-model are available at Tim Roughgarden's web page http://www.cs.cornell. edu/timr/ (which also has information and summaries).
15. T. Roughgarden and É. Tardos. How Bad is Selfish Routing? Journal of the ACM 49(2) (2002); pp. 236-259.
16. P. Sanders, S. Egner and J. Korst. Fast concurrent access to parallel disks. Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 849-858.