谣言传播算法随机选择邻居节点转发消息,降低了消息的覆盖范围.根据Gnutella网络的小世界及幂规律特性,提出基于连接度优化的dbRM改进协议.dbRM在搜索的不同阶段,依据连接度大小来选择消息的转发对象,跳数较低时优先选择连接度大的节点,以保证查询有一个必需的覆盖范围,且有助于消息快速到达目标节点,跳数较高时优先选择连接度小的节点,以尽量降低冗余消息的数量,从而在保持高覆盖率的同时尽量减少冗余消息的开销.分析和实验结果表明,dbRM能够提供较低负载的查询,高效应用于P2P搜索.%Rumor mongering algorithm selects neighbor nodes to forward messages randomly, reducing the coverage. According to Gnutella network's small world and power law characteristics .propose an improved algorithm dbRM which optimized based on connection degree. On different searching steps, dbRM cboses different nodes to forward messages according to their degrees. For ensuring a high coverage of message and finding the targets quickly, dbRM first select nodes which have biggest degrees when hop is low, and to reduce the redundant messages while keeping the high coverage rate it first select the nodes which have smallest degrees when hop is high. Analysis and simulation results show that the dbRM provides a low overhead broadcasting facility that can be effectively used in P2P searching.
展开▼
