Chord协议的改进双向路由表结构

The Improved Bidirectional Routing Table Structure of Chord Protocol

在结构化P2P网络中有效快速地定位节点非常重要。Chord是结构化网络中一种比较成功的路由算法。但是Chord的路由表存在着一定的信息冗余,且只能从环的一个方向查询,对于后半环节点信息的查询支持不足,由此导致查询定位的效率不高。基于这种不足,本文提出了一种改进后的Chord路由表结构,将路由表中的冗余信息替换为反向环中部分节点信息,同时在路由表中增加剩余反向环的节点信息,由于利用了原表的冗余项,因此在不至于增加过多路由表项数的情况下实现了路由表的双向查找。仿真实验表明,改进后的路由表结构提高了查询效率。

It is very important to locate the nodes effectively and quickly in structured P2P network.Chord is a successful routing algorithm in structured network.However,there is redundant information in the routing tables of Chord,and Chord searches for one node only in one direction,thus the support of searching in back Chord is insufficiency,which leads to poor efficiency in searching and locating nodes.Based on these deficiencies,an improved routing table of Chord is put forward in this paper.The redundant information in the routing table of Chord is replaced by the information of some nodes in the counter-rotating ring.At the same time,the information of the other nodes in the counter-rotating ring is added to the routing tables.Since the redundancy item in original table is made good use,searching of bidirectional routing table is implemented without increasing the items of finger table.Simulation experiment shows that the improved routing table structure improved the inquiry efficiency.