基于P2P网络的分布式广度优先搜索的研究

针对小范围P2P搜索环境，提出了全新的P2P搜索模型，并研究了该搜索模型的各重要组成部分：BFS算法、启发式搜索算法中2跳节点的信息、DBFS算法的思路，并着重阐述了DBFS搜索算法的主要策略及具体的设计实现。测试结果证明，采用分布式广度优先搜索算法的DBFS模型具有冗余的数据包少、能减轻网络的负载。提高P2P搜索的速度等优点。

Study of distributed breadth first search based on P2P network

This paper puts forward an new P2P search model specifically for small range P2P searches for an environment,and studies every important component being a model's turn respectively: DBFS algorithm,2 springs in the BFS algorithm,the algorithmic train of thought of DBFS,emphasize the main tactics,mathematics certificate and concrete design having set forth the DBFS algorithm coming true.The experiment bear results indicates redundancy data bag characteristics such as few,being able to lighten network loads on certain degree,enhances P2P search speed.