基于资源位置与节点反馈的P2P搜索算法

P2P Network Search Algorithm Based on Position of Resources and Feedback of Nodes

为了提高查询效率，本文提出了一种利用位置对节点分群，通过历史查询的搜索反馈结果动态选择转发与实际位置相邻节点的算法（FP算法）。该算法通过计算邻居节点的兴趣相关度，定期调整邻居节点。算法分析和实验结果表明，与泛洪式算法相比本算法在搜索时间上改进约10％～40％，同时很好地控制了总的消息数和重复访问节点的比例，提高了查询效率。

In order to raise searching efficiency, this paper presents an algorithm that groups nodes based on their position and chooses to forward the searching demand to practically contiguous nodes dynamically according to their historical searching feedback results. Through calculating neighbor nodes＇ degree of interest correlation, the algorithm adjusts neighbor nodes regularly. The analysis of the algorithm and the results of experiments show that, compared to flooding algorithm, this algorithm improves performance in terms of seaching time to 10%-40% , as well as controls the amount of messages forwarded and the proportion of repeating visit nodes, so it improves the searching efficiency.