Developing Ecient Search Algorithms for P2P Networks Using Proliferation and Mutation?

Abstract. Decentralized peer to peer networks like Gnutella are attrac-tive for certain applications because they require no centralized directo-ries and no precise control over network topology or data placement. The greatest advantage is the robustness provided by them. However, ooding-based query algorithms used by the networks produce enor-mous amounts of trac and substantially slow down the system. Re-cently ooding has been replaced by more ecient k-random walkers and dierent variants of such algorithms [5]. In this paper, we report immune-inspired algorithms for searching peer to peer networks. The algorithms use the immune-inspired mechanism of anity-governed proliferation and mutation to spread query message packets in the network. Through a series of experiments, on dierent types of topologies, we compare prolif-eration/mutation with dierent variants of random walk algorithms. The detailed experimental results show message packets undergoing prolifer-ation and mutation spread much faster in the network and consequently proliferation/mutation algorithms produce better search output in p2p networks than random walk algorithms.