Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and timevarying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elastic routing table (ERT) mechanism for query load balancing, based on the observation that high degree nodes tend to experience more traffic load. The mechanism allows each node to have a routing table of variable size corresponding to its capacity. The indegree and outdegree of the routing table can also be adjusted dynamically in response to the change of file popularity and network churn. Theoretical analysis proves the routing table degree is bounded. The ERT mechanism facilitates locality-aware randomized query forwarding to further improve lookup efficiency. By relating query forwa...

• Type: Conference
• Year: 2006
• Where: ICDCS
• Authors: Haiying Shen, Cheng-Zhong Xu
• Keywords: Distributed And Parallel Computing, ICDCS 2006, Load Balancing Algorithm, Query Forwarding, Routing Table