Research On Resource Search Strategie Of Unstruture P2P Network

In recent years, with the emergence of many P2P applications, P2P technology has once again become the focus of research. Based on the coordinate thought, P2P is good at scalability, robustness, privacy and has high-performance. And it is now used in file sharing, distributed computing, collaborative systems, searching engines and so on. With in-depth research, it will be used in more areas.One of the key works of P2P is resources-searching. In unstructured P2P system, peers cooperate to accomplish tasks, using flooding algorithm or its improved algorithms to spread messages between them to locate resources. Based on the analysis of the Local Indices algorithm and the Heuristic Flooding algorithm, the thesis suggests introducing the Heuristic Flooding algorithm into the Local Indices algorithm, in order to achieve the aim of good searching results and node coverage with significant reduction of query messages.Specific descriptions of the Heuristic Flooding algorithm and the Local Indices algorithm with Heuristic Flooding are given in this thesis. And after experiments the thesis concludes that comparing to the Local Indices algorithm with Flooding, the Local Indices algorithm with Heuristic Flooding makes the numbers of messages greatly reduced, while the results of queries and node coverage are satisfying.