D-Flooding:非结构化P2P网络中高效搜索策略  

D-Flooding : efficient search algorithm in unstructured P2P networks

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

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

出　　处：《计算机应用研究》2008年第8期2499-2501,2523,共4页Application Research of Computers

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

摘　　要：为了能够在保持高覆盖范围的前提下大大减少冗余消息的数量,提出了一种新的基于连接度的搜索机制D-Flooding。D-Flooding在搜索的不同阶段,依据连接度大小来选择消息的转发对象。分析和实验结果表明,D-Flooding能够提供较低负载的查询,高效地应用于P2P搜索。与标准洪泛机制相比,在跳数不变的情况下,冗余消息的数量可减少84.5%以上,而消息的覆盖范围基本不变。This paper proposed D-Flooding, an efficient degree-based flooding scheme, with the objective of minimizing the number of redundant messages and retaining the same message propagating scope as that of standard flooding. At the different searching steps, D-Flooding chose nodes to forward massages according to their degrees. Analysis and simulation results show that the D-Flooding scheme provides a low overhead broadcasting facility that can be effectively used in P2P searching. Com- pared with standard flooding used ;n Gnutella, it shows that the D-Flooding scheme with the same TTL can reduce up to more than 84.5% of flooding messages, and retain almost the same flooding scope.

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

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