基于Flooding的非结构化P2P网络搜索算法的研究  

Research of search algorithm on flooding-based in unstructured P2P network

作　　者：董会国[1] 

机构地区：[1]邢台职业技术学院,河北邢台054035

出　　处：《长沙通信职业技术学院学报》2010年第2期36-39,共4页Journal of Changsha Telecommunications and Technology Vocational College

摘　　要：当前随着P2P网络的广泛应用,P2P搜索技术发展迅速,在非结构化P2P网络中,如何快速、准确对资源定位是当前研究的热点问题,针对非结构化P2P网络中的搜索方法——广度优先搜索(BFS)可扩展性差和搜索效率不高的缺点,文章采用改进BFS搜索方法,按照邻居节点的相似度采取有选择性的发送搜索消息,降低了网络负载,提高了搜索效率。With the wide application of P2P networks, P2P search technology has developed rapidly. In unstructured P2P networks, the rapid, accurate positioning of resources is the hotspot of current research. Aiming at the poor expansibility and low search efficiency of the search method in unstructured P2P networks-breadth first search （BFS）, this paper improves the BFS search methods, tries to send search messages selectively according to the similarity of the neighbor nodes, which reduces the network load and improves the searching efficiency.

关 键 词：P2P 广度优先 洪泛算法 搜索技术 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术]