基于DHT的Chord路由算法改进  

Improvement of Chord Routing Algorithm Based on DHT

作　　者：宗平[1] 徐鸽[2] 

机构地区：[1]南京邮电大学海外教育学院,江苏南京210046 [2]南京邮电大学计算机学院,江苏南京210046

出　　处：《计算机技术与发展》2012年第9期139-142,共4页Computer Technology and Development

基　　金：江苏省科技支撑项目(BE2009157)

摘　　要：Chord路由查找算法是基于DHT散列表的,在可扩展性、稳定性及负载均衡方面有一定优势。鉴于网络中有些节点配置较低,导致Chord性能降低。文中为了改善通过低性能节点的概率,针对Chord本身的单路查找过程,采用起始点的并发式查找定位,通过多路径来定位资源节点,以此达到避免通过性能差的节点的可能,改进性能,减少查询时延。通过实验进行Chord查询时延和查询跳数的性能分析,仿真结果表明,在保持Chord原有健壮性的基础上,改进算法能够有效提高查找效率和降低查找时延。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 al- gorithm 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.

关 键 词：CHORD 分布式散列表 路由查找 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]