基于兴趣相关度的P2P网络搜索优化算法  

Improved Search Algorithms Based on Interests Correlation in P2P Network

作　　者：吴思[1] 欧阳松[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《计算机工程》2008年第11期102-104,107,共4页Computer Engineering

摘　　要：P2P网络中的搜索性能是影响P2P网络发展的关键问题。该文研究非结构化分散型P2P网络中的搜索机制,提出2个改进算法。改进算法利用节点的共享情况和查询历史发掘节点的兴趣爱好,并赋予节点一定的自治性,使得非结构化分散型P2P网络能随着网络中查询数的增长而动态优化,提高查询效率。实验证明改进算法提高了查询检索的效率,在保证查全率的基础上,查询产生的消息减少了75%。Search performance is the key for the development of P2P network. This paper studies search mechanism in unstructured P2P network and introduces two algorithms which improve the efficiency of search. The algorithms make full use of sharing situation and the history of queries in peers, which dynamically improve the P2P network with the growth of queries. Experimental results show that the amount of messages created by queries is declined by 75%, which proves that the algorithms improve the efficiency of search.

关 键 词：P2P网络 非结构化 搜索 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]