非结构化P2P网络中基于连接度的分段搜索策略  

Divisional searching strategy based on degree in unstructured P2P networks

作　　者：庄雷[1] 董西广[1] 常玉存[1] 

机构地区：[1]郑州大学信息工程学院,郑州450052

出　　处：《计算机应用》2008年第3期549-552,557,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(69873040);河南省教育厅基础研究项目(2003520256)

摘　　要：洪泛机制由于其简单性而被广泛应用于目前的非结构化P2P文件共享系统中,尽管它在内容搜索方面有很高的效率,但同时产生了大量的冗余消息,严重制约了网络的可扩展性。现有的改进搜索策略虽然减少了冗余消息的数量,但也明显降低了消息的覆盖范围。为了能够在保持高覆盖范围的前提下减少冗余消息的数量,提出了一种新的基于连接度的分段搜索策略DSearch。DSearch把搜索过程分为两个阶段,各个阶段中使用函数来控制消息转发的数量,然后依据邻居节点的连接度大小来选择消息的转发对象。分析和实验结果表明,DSearch能够提供较低负载的查询,高效地应用于P2P搜索。Flooding is widely used in current unstructured P2P systems because of its simplicity. Although it is effective in content search, flooding is very inefficient because it results in a great number of redundant messages. This greatly restricts the scalability of the networks. The existing improved search mechanism can reduce the redundant messages but also usually significantly shrink the query coverage range. DSearch, a divisional search strategy based on degree was proposed, with the objective of minimizing the number of redundant messages and retaining the same message propagating scope as that of standard flooding. DSearch divided the searching into two stages. At each stage ]）Search controlled the number of messages to forward by a function, and then it chose objects to send according to its neighbors＇ degree. Analysis and simulation results show that the DSearch provides a low overhead broadcasting facility that can be effectively used in P2P searching.

关 键 词：对等网络 GNUTELLA 洪泛 连接度 

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