Efficient Query Induction for Content Searching in Unstructured Peer-to-Peer Network

When considering content sharing in unstructured Peer-to-Peer network, flooding is usually carried out for contents searching. However, due to the increase of the number of queries, the network is congested, and the improvement of this point has been discussed. In the former research, a method which records the routes of the past content delivery and makes the new queries for the same content follow the trail was proposed. In this research, the conventional method is improved and proposed as a new method which controls query inducing directions according to the number of hops to the destination peers. By using this improved method, network cost during contents' searching and transferring is expected to be reduced compared with the conventional method. The effectiveness of the proposed method is evaluated by computer simulations.