基于Gnutella的P2P网络路由改进算法  

Improvement of route algorithm for P2P network based on Gnutella

作　　者：李杰[1] 邓亚平[1] 

机构地区：[1]重庆邮电大学计算机科学与技术学院,重庆400065

出　　处：《计算机应用》2010年第A01期21-23,26,共4页journal of Computer Applications

摘　　要：洪泛算法是无结构P2P网络的基本路由算法,但产生的巨大冗余信息严重降低了该算法的效率。结合洪泛搜索算法和随机走动算法的优点,在维持了洪泛算法响应时间短、稳定性高、结构简单的基础上大大减少了冗余信息的产生,实现了一种改进的路由搜索算法:跳跃随机式洪泛算法。实验结果显示,在保持理想的节点覆盖率的情况下大大减少了冗余信息,提高了搜索效率,改善了网络运行环境。The huge redundant messages generated by flooding which is the basic routing algorithm of unstructured P2P network, severely reduce the efficiency of the algorithm. Combining the advantages of flooding search algorithm and random walk algorithm, such as short response time, high stability, simple structure, to greatly reduce the redundancy of messages, this paper proposed an improved route search algorithm： JumpRandom-flood. The simulation results show that the algorithm can reduce the redundant messages, increase the efficiency of search, and improve the network environment while maintaining the desired coverage rate of nodes.

关 键 词：对等网络 洪泛算法 随机走动 GNUTELLA网络 

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