Route Table Based Information Retrieval Mechanism Research In Peer-to-Peer Network

In recent years, along with the emergence of many P2P systems, the P2P technique becomes the researchful hotspot. Now the P2P technique is mainly applied in file-sharing, distributed calculation, cooperating systems, electronic commerce and search engine. One of the most popular P2P application is the file-sharing system.In a P2P file-sharing system, each peer performs as both a server and a client, which means that they can get resources form remote sites, meanwhile, they are also providing local resources for other peers. Howerver, existing P2P searching mechanisms are usually dissatisfied. For example, structured P2P systems are efficient but lack of actual implements on the Internet, because of their complicated structures. And it can only support the file-sharing of coarse granularity. Unstructured P2P systems can be implemented simply and they are more popular. But they are inefficient because of the blind routing.From various perspectives, our work focuses on how to improve information retrieval efficient of unstructured P2P file-sharing systems. In this paper, a routing strategy that can adapt to the extension of network is proposed to attack the problem of blind routing in P2P search. During the course of searching, the information of every replying node is saved in route tables of its two neighborhood nodes respectively according to the responding order, and which will be used to guide the following routing. Initial neighborhood node is chosen to route in case of no information available, which makes use of the characteristics of the initial topology. At last, author presented a desirable experimental result, and proved the validity and efficiency of the algorithm.Because many users are usually interested in the top several results, and every answered peers return the results to the request peer straightly, the request peer's load is increased. Standing on this point, basing on the routing table, this paper adopts the top-k query to process the results. During returning the results, the answered peer returns the top-k documents to the request peer, according to the query condition. If the number of satisfied results is fall short of k, the answered peer merely returns the satisfied results. In this way, it can reduce the network spending and lighten the request peer's load. At the end of this part, the experimental results manifest that this strategy is practical and precise.