Load balancing for two-tier Chord system

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.