Research And Optimization Of Chord About Load Balancing

Distributed hash table algorithm can make the distributed system has good scalability, robustness and adaptability, and it has been widely used in the distributed system. In the operation process of the application system, it is found that the distributed hash table algorithm would constantly giving most of the load distribution to a small number of nodes, so that part of the nodes shoulder heavier load in the application system. In a result, system load imbalance shows between the nodes. And the node load imbalance between the nodes will result in single point bottlenecks, idle resources and other conditions, which can't meet the actual demand of the system.In order to improve the load balance problem, this paper proposes a distributed hash table load balance improvement algorithm: to carry on dynamic modification to the node ID on the base of the node load condition, and therefore changes the management space of the node, and makes the load equally distributed among each node. Load balance algorithm mainly includes load migration and node ID changes broadcast. Load migration algorithm makes each node collect information about its precursor and subsequent nodes, achieving the goal of local load balance by load migration; Node ID change broadcast, and when necessary, it will broadcast the information of the change of node ID in the distributed hash table network, and inform of all the nodes in network to modify the routing information, and ensure the correctness of the routing process.Tests have shown that according to the current situation of the node load in the system, the improved application system put forward by the paper can adjust the distribution of the load among nodes. In a result, the load balance of the system has improved and therefore improving the overall performance of the system.