Hash-based proximity clustering for load balancing in heterogeneous DHT networks

DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network nodes in proportion to their capacity so as to eliminate traffic bottleneck. It is challenging because of the dynamism nature of DHT networks and time-varying load characteristics. In this paper, we present a hash-based proximity clustering approach for load balancing in heterogeneity DHTs. In the approach, DHT nodes are classified as regular nodes and supernodes according to their computing and networking capacities. Regular nodes are grouped and associated with supernodes via consistent hashing of their physical proximity information on the Internet. The supernodes form a self-organized and churn resilient auxiliary network for load balancing. The hierarchical structure facilitates the design and implementation of a locality-aware randomized load balancing algorithm. The algorithm introduces a factor of ...

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Haiying Shen, Cheng-Zhong Xu
• Keywords: DHT Load Balancing, Distributed And Parallel Computing, IPPS 2006, Load Balancing, Load Balancing Algorithms