A Search Method Using Temporary Links for Unstructured P2P Networks

In this paper, we propose an efficient search method for unstructured P2P networks. The method is based on the existing method called expanding ring in which the search area is gradually enlarged. In expanding ring, a large number of queries are forwarded unnecessarily because the same query is forwarded to the same node multiple times. We mitigate this problem by using temporary links. By conducting simulations, we demonstrate that the proposed method can spread search queries with fewer messages than existing methods. We also show that it is possible to search efficiently in various types of networks by using degree and cluster coefficient information obtained from the nodes through which a search query passes.