Load Balancing White Papers
Load Balancing in Structured P2P Systems
Overview Most P2P systems that provide a DHT abstraction distribute objects among "Peer nodes" by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P systems can be highly heterogeneous, i.e. they may consist of peers that range from old desktops behind modem lines to powerful servers connected to the Internet through high-bandwidth lines. This paper addresses the problem of load balancing in such P2P systems. It explores the space of designing load-balancing algorithms that uses the notion of "Virtual servers". It presents three schemes that differ primarily in the amount of information used to decide how to re-arrange load.
| Publisher | University of California | File Format | |
|---|---|---|---|
| Date Published | January 2008 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 5 users found this white paper useful
White Paper RSS
Download
Register
