Abstract: Considering that Chord model does not make good use of the counterclockwise routing information and it does not consider the actual network topology which leads to high latency and low efficiency, this paper presents a routing algorithm, named Topology and Bidirection guided Chord(TB_Chord), which makes full use of the routing information and takes the proximity of peers in underlying physical network into account. It stores the search results in the super-node in each cluster. Experimental results show that this method is superior to original Chord at path length and access latency.

Key words: P2P network, Chord algorithm, topology, bidirectional search, super-node

摘要： Chord模型未充分利用逆时针上的路由信息，并且未考虑实际网络拓扑结构，使P2P系统存在高延迟、低效率的问题。针对该问题，充分利用节点路由表信息和节点在物理网络上的邻近性，并用超级节点存储最近同一簇内的查询结果，提出路由算法TB_Chord。模拟实验结果表明，该算法在路径长度、访问延迟方面的性能较Chord有一定的提高。

关键词: 对等网络, Chord算法, 拓扑, 双向搜索, 超级节点

CLC Number: 

• TP393