Abstract
Compared to flat distributed hash table (DHT) systems, hierarchical DHT systems can use some powerful and stable peers (called superpeers) to achieve efficient look-up under churn. Several hierarchical DHT systems have been proposed so far. However, a crucial problem faced by all these systems is the load imbalance among superpeers. Proposed is a novel load balancing algorithm to efficiently solve this problem in a two-tier Chord system. Analysis and simulation results show that the algorithm can balance the load among superpeers in proportion to their capacity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
