chord路由表结构的分析与改进  

Analysis and improvement of finger table in chord protocol

作　　者：祁玉[1] 张新有[1] 

机构地区：[1]西南交通大学信息科学与技术学院,四川成都610031

出　　处：《计算机工程与设计》2010年第6期1170-1172,1176,共4页Computer Engineering and Design

基　　金：国家自然科学基金项目(60773102)

摘　　要：针对Chord协议在大规模的P2P网络中存在路由表结构信息严重冗余、查找效率不高等缺点,在深入分析路由表构造的基础上,提出新的路由表构造公式,增加路由表中节点的分布密度,最终达到了删除路由表的冗余表项,扩大路由查找覆盖范围的目的。理论分析表明,改进后的路由表的查找效率较原chord提高了29%,仿真实验结果也表明改进后的查找效率有显著提高。Chord protocol has the faults of serious redundancy and low searching efficiency in large scale network.Response to these issues, based on deeply analyzing the structure of routing list, new route table structure formulas are proposed, node distribution density of routing list is increased, and finally goals of deleting redundant information and increasing route searching coverage areas are realized.Theory analysis shows that the modified approach reduces the path length at least 29%, and the final experiment result also proves that location efficiency is improved obviously.

关 键 词：对等网络 分布式散列表 CHORD 路由 冗余 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]