摘要
针对原始Chord路由中查寻效率不高以及表项存在冗余信息的问题,提出一种改进的Chord路由算法,利用对立节点建立顺时针与逆时针两个路由表,实现了双向查寻,同时改进了路由表构造方法,减少了冗余表项.理论分析与仿真实验表明,该算法降低了查询的平均路径长度,提高了查寻效率.
In this paper, an improved Chord routing algorithm is proposed to solve problems of inefficient search and redundant information in original Chord routing. These clockwise and counter clockwise routing tables are established using the opposite node to implement bidirectional search. Meanwhile, the routing table construction method is improved to reduce redundant items in routing tables. Theoretical analysis and simulation results show that the proposed algorithm can reduce the average path length of queries and improve the search efficiency.
出处
《湖南理工学院学报（自然科学版）》
CAS
2017年第1期17-20,51,共5页
Journal of Hunan Institute of Science and Technology(Natural Sciences)
基金
湖南省科技计划项目(2016TP1021)
湖南理工学院学位与研究生教育教改项目(YJG2017A004)
湖南省研究生科研创新项目(CX2016B671)
