Chord路由算法的研究与改进  

Research and improvement of Chord routing algorithm

作　　者：王必晴[1] 

机构地区：[1]铜陵学院数学与计算机科学系,安徽铜陵244000

出　　处：《计算机工程与应用》2010年第14期112-114,共3页Computer Engineering and Applications

基　　金：铜陵学院2009年度院级科研项目(No.2009tlxy22)

摘　　要：高效查找资源是P2P网络的关键。Chord是一种结构化的P2P网络,存在路由表信息冗余、查找效率不高的问题。为此,提出了一种改进的Chord路由算法,在不增加路由表长度的前提下,将路由表中的重复表项删除,同时增加相同数目的反向路由。仿真实验表明,算法消除了路由表信息冗余,减少了平均查找跳数,提高了查找效率,使提高查找效率和控制路由表长度得到很好的统一。The key in P2P network is to locate resources effectively.Chord is a kind of structured P2P network,but the routing table in Chord suffers serious information redundancy and it is not very efficient.Therefore,an improved Chord routing algorithm is proposed.On the premise of not increasing the length of routing table,repetitious entries are deleted and anticlockwise routing in the same amount are added.Simulation experiments show that the algorithm eliminates information redundancy,reduces the average lookup path length and gets higher efficiency so as to coordinates lookup efficiency and route table length well.

关 键 词：对等网络 CHORD 路由 

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