P2P Search Approach Research And The Application

Peer-to-Peer (P2P) technology has become a popular technology and regained people's attraction in these years. While P2P technology is applied more and more, improvements of this technology is called for. On one hand, as one of the key technologies, P2P search mechanism mainly decides the performance of whole P2P system. Mechanism exsiting however can not fully satisfy requirements in some of P2P system and becomes the bottle neck of the whole P2P network system. On the other hand, topology of P2P network also affects the performance of P2P system. The way to organize all of peers in the P2P network is related to the search mechanism. An efficient search mechanism is always deploied in an efficient P2P network topology. Consequently, to improve the P2P system's performance, a simpler and more efficient topology is necessary. Therefore, issues majoring in both search mechanism and topology are discussed in this paper.Analyzing the P2P overlay topology modols the advantages and disvantages are concluded in this paper. Meanwhile, some of the P2P search strategies deployed in all topology modols is deeply researched. At the end, a common conclusion is reached that new search mechanism is needed since none of the exsiting mechanism is perfect. According to Connected Dominate Set (CDS) theory in graph field and considering the small world characteristic and power law of P2P network, a new P2P overlay topology is proposed and demonstrated in the paper. To proof the advantages of the topology, a search strategy based on CDS is proposed and the algorithm named Spacds is showed in the paper as well. Through simulating the algorithm and comparing with another three classic unstructured search algorithm, the improvement and advantages like time complexity and space complexity are demonstrated and that indirectly proves the advantages of the new topology.