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

第 25 卷第 8 期 计 算 机 应 用 研 究 Vol. 25 No. 8 2008 年 8 月 Application Research of Computers Aug. 2008 D-Flooding: 非结构化 P2 P 网络中高效搜索策略* 董西广, 庄 雷, 常玉存 ( 郑州大学 信息工程学院 , 郑州 450052) 摘 要: 为了能够在保持高覆盖范围的前提下大大减少冗余消息的数量, 提出了一种新的基于连接度的搜索机 制 D-Flooding。D-Flooding 在搜索的不同阶段, 依据连接度大小来选择消息的转发对象。分析和实验结果表明 , D-Flooding 能够提供较低负载的查询, 高效地应用于 P2P 搜索。与标准洪泛机制相比 , 在跳数不变的情况下 , 冗 余消息的数量可减少 84. 5% 以上, 而消息的覆盖范围基本不变。 关键词: 对等网络; 洪泛; 连接度 中图分类号: TP393 文献标志码: A 文章编号: 1001- 3695( 2008) 08- 2499- 03 D-Flooding: efficient search algorithm in unstructured P2P networks DONG Xi-guang, ZHUANG Lei, CHANG Yu-cun ( School of Information Engineering, Zhengzhou University, Zhengzhou 450052, China) Abstract: 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 in 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. Key words: peer-to-peer network; flooding; degree live) 约束。消息产生时, 被赋予一个初始 TTL 值 ( Gnutella 默 0 引言 认为 7) ; 查询过程中, 消息每向前一跳, TTL 值减 1;