Implementation of an enhanced file search efficiency in P2P network

The original intent of the peer-to-peer (P2P) concept is to treat each participant equally, heterogeneity widely exists in deployed P2P networks. In many aspects peers are different from each other such as bandwidth, CPU power, and storage capacity. Various approaches have been taken with the use of query forwarding heterogeneity i.e. the high band width of powerful nodes can be fully initialized to increase the system capacity. In this paper, we suggest to directly improve the search efficiency of P2P network using the query answering heterogeneity. In our proposed Differentiated Search (DiffSearch) algorithm, the peers with high query answering capabilities will have the highest priority to be queried. Since the query answering capacities are extremely unbalanced among peers by querying a small portion of a network a high query success rate can be achieved. The search traffic is further reduced due to the shrunken search space. For example, the random walk or DHT can still be applied in the ultrapeer overlay to further reduce the search traffic, which will be investigated in this paper. This paper analysis and implement flooding search, proposed diffsearch algorithm, diff search algorithm with random walk techniques and compare these algorithm and finally show that the DiffSearch algorithm with random walk can save more than 80 percent of search traffic.