一种基于节点信息复制与查询热点的Chord改进算法  

CH-CHORD:AN IMPROVEMENT OF CHORD ALGORITHM BASED ON INFORMATION REPLICATION AND LOOKUP HOT-SPOTS

作　　者：钟评[1] 胡彧[2] 

机构地区：[1]太原理工大学计算机科学与技术学院,山西太原030024 [2]太原理工大学测控技术研究所,山西太原030024

出　　处：《计算机应用与软件》2013年第2期300-303,311,共5页Computer Applications and Software

摘　　要：Chord算法的改进一般是通过改善其路由表结构或者修改其查询算法。由于修改路由表结构的方法在降低平均查询跳数与时间的同时通常增加了路由表长度,使得Chord在维护时占用更多的带宽且改善效果并不理想。通过分析Chord在查询过程中的路由特点,提出一种基于节点信息复制和查询热点的改进算法CH-Chord,并通过仿真实验证明该算法在减少平均查询跳数、查询时间、查询失败率的同时并没有增加Chord稳定时的维护消耗。The way to improve Chord algorithm is mostly by means of modifying the structure of finger table or improving the method of lookup.Since the means of modifying the structure of finger table usually increases the size of finger table while decreases the average lookup hops and latency,this leads the Chord to cost more bandwidth in maintaining but not gain satisfied melioration effect.In this paper we analyse the routing properties of Chord in lookup process and propose an improved algorithm CH-Chord,which is based on information replication and hot-spots in looking up.We also prove by simulation that the CH-Chord can decrease the average lookup hops and latency and failure ratio without additional bandwidth cost in maintenance as in stable status.

关 键 词：CHORD算法 节点信息复制 分布式哈希表 对等网 

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