| Popis: |
A novel P2P algorithm and Unit Tree-based Breadth First Search (UTBFS) algorithm are proposed in this paper. The characteristic of algorithm in this paper are as follows: 1) putting forward the idea of unit tree spanning algorithm.2) Integrating unit tree spanning algorithm with Breath First search, and making an analysis of its performance in terms of time complexity degree, space complexity degree and superiority. The results of the simulated experiment demonstrate that UTBFS reduces the number of neighbor nodes and redundant message and is of higher searching efficiency as compared with traditional Breath First search algorithm and Random Breath First search algorithm. |
