基于对等结点指针表优化的Chord算法改进

对等网络需要解决的一个关键性问题是如何有效地查找存储所需资源的结点。文中在研究分布式查找算法Chord的基础上，介绍了分布式哈希表（DHT）的主要思想，阐述了资源关键字查找方式，重点分析结点指针表的特性及其表中冗余信息对查找资源的影响，进而提出了覆盖冗余信息的方法（uRFchord）改进结点指针表。URFChord方法首先要计算指针表的冗余量R（N），然后在不增大指针表存储空间的情况下，删除指针表冗余信息再添加R（N）个新的路由信息。通过性能分析及仿真实验，证实了这种改进方法的可行性和有效性，减少了平均查找路径长度，提高了查询效率。

Improvement of Chord Algorithm by Optimizing Finger Tables for Peer Nodes

A key issue existed in P2P network is how to effectively find the storage node of the resources required. Upon the research on distributed lookup algorithm Chord,it introduces the main idea of distributed hash table （ DHT）, and elaborates the way of resource key- word search with focus on the analysis of the characteristics of node finger table and the influence of redundant information on the re- source search. And then a redundant information coverage method （URFChord） is proposed to improve the finger table at each node. This method requires each node to calculate the redundancy of its finger table, denoted as R （ N ）, delete the redundant information and add a total of R（N） new routing information into the table without increasing the storage space of the finger table. Results from perform- ante analysis and simulation experiments show that this improvement is feasible, and to some extent, it can reduce the average search path length and improve the query efficiency.