The Structured Based P2P Search Algorithm

With the rapid development of the science and the increasing popularity of the internet, the P2P system has attract more and more attentions of the researchers and scholars because its good behaves in both the scalability of organize big scale network and resource location. Now, how to locate the peer node that is responsible for storing the requested resource efficiently has become one of the core problems in the P2P system and it also the bottleneck of the P2P development.Based on the investigations of the chord algorithm's search efficiency, we decide to introduce two strategies;'second successor'and'neighbor table'to improve the chord's searching efficiency. By adopting the'second successor', each node can expand its resource determined scope which can reduce the logical routing hops in searching. And by using'neighbor table', node can take the physical network topology into account when redirect the query which can meet matching between logical network topology and physical network topology in a certain degree, which can indirect improve the Chord's searching efficiency overall.Finally, in order to verify the performance of the improvement strategies, we wrote a program based on the simulation tool PeerSim to simulate the original Chord and the improved one. By comparing and analysis of the experimental results, we got a conclusion that the improved protocol has better performance in resource searching than the original one without affecting its original load balancing.