基于小世界与兴趣相关度的P2P网络搜索研究

Research of Web-searching on small-world and interest correlation in P2P network

构造了具有小世界特性的非结构化P2P网络,并依赖网络节点的兴趣相关度,提出了一个基于小世界与兴趣相关度的P2P网络搜索算法,使查询消息在更高效的路由路径中传播,避免了消息转发中的盲目性。实验从算法的查全率、通信开销、覆盖率等方面说明了本文搜索算法与洪泛算法相比产生的代价更小,证明了本文搜索算法的有效性。

This paper introduces a search algorithm based on small-world and interest correlation. Relying on interest correlation, the algorithm allows message inquired spreading in a more efficient routing path to avoid the blindness of the message transmitting. Viewing from aspects of recall, communication costs and coverage, the experiments show that the search algorithm costs less compared with the flooding search algorithm, which proves the effectiveness of the search algorithm proposed by this paper.