Load Balancing White Papers
Ef?cient, Proximity-Aware Load Balancing for Structured P2P Systems
Overview Structured Peer-to-Peer (P2P) systems address the load balancing issue in a rather naive way, by simply resorting to the uniformity of the hash function utilized to generate object IDs. Such a random choice of object IDs could result in O(logN) load imbalance. This paper proposes an efficient, proximity-aware load balancing algorithm for such systems. This is the first work to utilize the proximity information to guide load balancing. In particular, the main contributions are: A self-organized, fully distributed K-nary tree structure is constructed on top of a DHT for load balancing information collection/dissemination and load reassignment.
| Publisher | University of Cincinnati | File Format | |
|---|---|---|---|
| Date Published | August 2003 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 0 out of 1 users found this white paper useful
White Paper RSS
Download
Register
