Effective Use of Multiple Random Walks in P2P Networks

Abstract

Nowadays, millions of users search and download desired data such as Napster and Gnutella as they are Peer-to-Peer (P2P) files sharing applications. In order to improve performance in unstructured P2Ps replication strategies are used. Efficient and effective full-text retrieval over unstructured p2p networks was developed in order to address the problems of the query popularity independent replication strategies, previously a novel strategy. In order to support random node sampling and network size estimation a lightweight DHT with an unstructured P2P overlay. However these well-organized techniques are executed irrespective of topologies and network size concerns. To overcome this problem, we propose a query algorithm based on multiple random walks that resolve queries almost as quickly as unstructured P2P overlay method while reducing the network traffic by two orders of magnitude in many cases. We also present simulation results on a distributed replication strategy.