Paper Info
Title
Efficient, Proximity-Aware Load Balancing for Structured P2P Systems
Abstract
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. In this position paper, we propose an efficient, proximity-aware load balancing algorithm for such systems. To our knowledge, this is the first work to utilize the proximity information to guide load balancing. In particular, our main contributions are: (1) 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. (2) Load balancing is achieved by aligning those two skews in both load distribution and node capacity inhere in P2P systems 驴 that is, have higher capacity nodes carry more loads. (3) Proximity information is utilized to guide load balancing such that virtual servers are assigned and transferred between physically close heavy nodes and light nodes, thereby minimizing the load transferring overhead and making load balancing fast and efficient.
Year
DOI
Venue
2003
10.1109/PTP.2003.1231534
Peer-to-Peer Computing
Keywords
Field
DocType
p2p systems,proximity-aware load,higher capacity node,information collection,object ids,load balancing,proximity information,load imbalance,load distribution,p2p system,load reassignment,tree structure,hash function,tree data structures,distributed processing,computational complexity,load balance,resource allocation,self organization
Network Load Balancing Services,Network Load Balancing,Load balancing (computing),Computer science,Tree (data structure),Computer network,Round-robin DNS,Resource allocation,Hash function,Tree structure,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2023-5
8
0.57
References 
Authors
3
2
Name
Order
Citations
PageRank
Yingwu Zhu136223.69
Yiming Hu263944.91