Design of a Robust Search Algorithm for P2P Networks

In this paper, we report a decentralized algorithm, termed ImmuneSearch, for searching p2p networks. ImmuneSearch avoids query message flooding; instead it uses an immune-systems-inspired concept of proliferation and mutation for message movement. In addition, a protocol is formulated to change the neighborhoods of the peers based upon their proximity with the queried item. This results in topology evolution of the network whereby similar contents cluster together. The topology evolution help the p2p network to develop ‘memory’, as a result of which the search efficiency of the network improves as more and more individual peers perform searches. Moreover, the algorithm is extremely robust and its performance is stable even when peers are transient.

• Type: Conference
• Year: 2004
• Where: HIPC
• Authors: Niloy Ganguly, Geoffrey Canright, Andreas Deutsch
• Keywords: Decentralized Algorithm, HIPC 2004, P2P Network, Topology Evolution