Uncoordinated Load Balancing and Congestion Games in P2P Systems

  • Subhash Suri
  • Csaba D. Tóth
  • Yunhong Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3279)


In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other users also choose that same peer. This interaction is best modeled as a game among self-interested agents, which we call uncoordinated load balancing. The players in this game are the rational and strategic users who are free to act in their own self-interest. We describe some of our recent work on this problem, and propose several new research directions, including analyzing Nash equilibria under general latency functions, a cost to switch servers, settings where user groups are dynamic, as well as the complexity of finding Nash solutions, and incentives for peers to be truthful in revealing their load.


Nash Equilibrium Load Balance Switching Cost Latency Function Competitive Ratio 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Awerbuch, A., Azar, A., Grove, E.F., Krishnan, P., Kao, M.Y., Vitter, J.S.: Load balancing in the Lp norm. In: Proc. 36th FOCS, pp. 383–391 (1995)Google Scholar
  2. 2.
    Bernstein, D., Feng, Z., Levine, B., Zilberstein, S.: Adaptive peer selection. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 237–246. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th SODA, pp. 413–420 (2002)Google Scholar
  4. 4.
    Harvey, N., Ladner, R., Lovász, L., Tamir, T.: Semi-matchings for bipartite graphs and load balancing. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 294–306. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Kothari, A., Suri, S., Tóth, C.D., Zhou, Y.: On a server selection game among selfish clients (in preparation)Google Scholar
  6. 6.
    Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: Proc. 2nd Conf. on EC, pp. 242–252 (2000)Google Scholar
  8. 8.
    Papadimitriou, C.: Algorithms, games, and the Internet. In: Proc. 33rd STOC, pp. 749–753 (2001)Google Scholar
  9. 9.
    Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. of Game Theory 2, 65–67 (1973)zbMATHCrossRefGoogle Scholar
  10. 10.
    Roughgarden, T.: Selfish Routing. PhD thesis, Cornell University (2002)Google Scholar
  11. 11.
    Roughgarden, T., Tardos, E.: How Bad is Selfish Routing? Journal of ACM 49(2), 235–259 (2002)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Roussopoulos, M., Baker, M.: CUP: Controlled Update Propagation in Peer-to-Peer networks. In: USENIX Annual Technical Conference, pp. 167–180 (2003)Google Scholar
  13. 13.
    Suri, S., Tóth, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proc. 20th SoCG (2004) (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Subhash Suri
    • 1
  • Csaba D. Tóth
    • 1
  • Yunhong Zhou
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA
  2. 2.Hewlett-Packard LaboratoriesPalo AltoUSA

Personalised recommendations