摘要： P2P网络普遍采用Chord算法，该算法使用一致性哈希函数为关键字和节点分别分配一个m位的标识符，使关键字较均匀地分配到节点上，以获得一个负载均衡的环形结构。该文在Chord算法中引入连通度选择，根据对节点已收发信息的分析，建立信息连通键值，调整节点关键字序列，减少低效信息的查询与传输。仿真实验证明，改进后的算法具有更低盲点率、更高即效性和搜索能力。

关键词: 连通度, 选择, 对等网络, 搜索算法, Chord算法

Abstract: P2P networks always use the Chord algorithm which uses the uniform Hash function for separately assigning a m identifier to the key word and the node, and obtains a ring-like structure which is loaded with balance. This paper introduces connectirity choice into Chord algorithm. According to the received and dispatched information analysis of the node, it establishes the key value of information connects, adjusts the sequence of the node and the key word, and reduces the inquiry and transmission of the low effect information. Simulation experiment proves that the improved algorithm has a lower scotoma rate, higher effect and higher search ability.

Key words: connectivity, choice, P2P network, search algorithm, Chord algorithm

中图分类号: 

• TP393.07