A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An Improved P2P Model Based on Chord
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Load balancing in dynamic structured peer-to-peer systems
Performance Evaluation - P2P computing systems
Query-load balancing in structured overlays
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
The Server Reassignment Problem for Load Balancing in Structured P2P Systems
IEEE Transactions on Parallel and Distributed Systems
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks
Computers and Electrical Engineering
Hi-index | 0.00 |
The dynamic load imbalance problem, probably caused by the heavy-tailed distribution of file requests, negatively impacts on the distributed hash table (DHT) networks' availability. The existing solutions mainly employed the local load information to design the load balancing strategies, which often need to calculate the peers' loads and execute the balancing procedures periodically, and thus their effectiveness could not be guaranteed and network bandwidth is wasted. To address this problem, we first describe the mechanisms for managing the download volume and the upload volume of each peer, as well as the information of the heavily loaded nodes and the lightly loaded nodes classified by double thresholds, and then we present a novel load balancing strategy which transfers the loads from the heavily loaded nodes to the lightly loaded nodes with the push and pull approaches. The simulation results show that our scheme is effective and efficient in handling the load imbalance problem in DHT networks.