Improvement of Chord Routing Algorithm Based on DHT
Ge Xu · Computer Technology and Development · 2012
Chord used DHT as a search strategy base.It has the advantages in load balancing,reliability,scalability and others.However,when there are some low efficiency nodes in the network,Chord will be affected with the low efficiency and cause high latency terribly.So it proposes a parallel routing finding model beginning with the start node against Chord's single routing mechanism.This improved algorithm decreases the probability of routing with bad nodes and then increases the finding efficiency.Analyse the performance of finding latency and hops by experiments.And maintaining the robustness of the original Chord,the simulation experiments show that the improved algorithm can enhance the efficiency and reduce the time delay of the routing finding.