基于新路由表的双向搜索chord路由算法

针对结构化P2P（Peer to Peer）网络资源高效搜索问题，提出了一种基于新路由表的双向搜索chord路由算法。该算法为解决chord算法路由表中存在着大量冗余信息，查找资源效率低下等缺点，提出了一个新的路由表构造公式。该公式首次加入路由因子概念，充分考虑了网络中节点个数和资源个数对路由表的影响，在不增加路由表项的前提下，不仅基本删除了路由表的冗余项，还实现了chord环的双向查找以减少平均查找跳数。实验仿真结果表明，该算法基本消除了路由表中的冗余信息，减少了平均查找跳数，有效地提高了资源的查找效率。

Bidirectional search chord routing algorithm based on new finger table

A bidirectional search chord routing algorithm based on new finger table is proposed according to the issue of searching resources efficiently in structured P2P network. This algorithm puts forward a new finger table structure formula to solve the problem of overmuch redundancy and low searching efficiency. On the premise of not increasing the finger table’s item, the new formula proposes routing factor and makes full use of the average distance between nodes in chord ring. The new finger table not only has no redundancy items, but also achieves bidirectional search in chord ring to reduce the average lookup path length. The simulation results show that this algorithm removes the redundancy information, reduces the average lookup path length and gets higher efficiency.