The Application of Broad First Minimum Spanning Tree Algorithm Based on Prim Algorithm in P2P Network

To improve information retrieval speed, it is the key of minimizing traffic and every required visit peer on the view of reducing traffic, combining the merit of width first search won´t lead to redundant and P2P network´s dynamic feature, We advanced adopting width first search in local bound-Broad first minimum spanning tree search. It can reduce redundant search packet in some scope. Meanwhile, It won´t occupy much network resource in message exchange because of scope is small. The way have good feature in expansibility and robustness. It can adapt to dynamic change in P2P network.