Load Balancing White Papers
Uncoordinated Load Balancing and Congestion Games in P2P Systems
Overview 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 is called as uncoordinated load balancing. The players in this game are the rational and strategic users who are free to act in their own self-interest. This paper describes some of the recent work on this problem, and proposes several new research directions, including analyzing Nash equilibria under general latency functions, a cost to switch servers, settings where user groups are dynamic.
| Publisher | University of California | File Format | |
|---|---|---|---|
| Date Published | January 2008 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 1 out of 4 users found this white paper useful
White Paper RSS
Download
Register
