基于稠密P2P网络搜索机制的研究

计算机对等联网(Peer-to-Peer Network,P2P)技术是目前新一代网络技术研究的活跃领域,而P2P网络中文件搜索机制的研究是P2P网络技术研究的重要环节。文章着重介绍了P2P网络的几种系统结构以及相应的文件搜索机制,分析了他们的优缺点,并在其基础上提出了一种高效的适合于当前P2P网络的文件搜索机制——部分最小洪泛搜索(PartialMinFlood)。经分析和试验结果表明:该机制能够大大减少网络中的冗余消息,而消息的传播范围基本保持不变(和标准洪泛搜索时的相同),能够有效地提高P2P网络的扩展性。

Study on Search Scheme in Dense Peer-to-Peer Networks

Peer-to-peer(P2P) networking technology is a currently popular technology in the network research domain.And research of P2P network architecture is an important problem in the P2P network investigation.This paper emphatically introduces several architectures of P2P network model and several searching mechanisms applying to file searching.By analyzing their advantage and disadvantages,writers propose PartialMinFlood,an efficient search scheme for modern P2P network.Our analysis and simulation results show that the PartialMinFlood scheme could greatly minimize the number of redundant messages and retain the same message propagating scope as that of standard flooding scheme,and efficiently improve the scalability of P2P network.