A Scalable Search Algorithm on Unstructured P2P Networks

Gnutella is one of the prominent unstructured P2P networks. In the unstructured P2P networks, the network topology and the placement of files are largely unconstrained. The primitive search algorithm in Gnutella is flooding-based. The algorithm produces too much traffic though with limited search region which is constrained by TTL value. To improve search efficiency and reduce unnecessary traffic in Gnutella, this paper proposes an algorithm to unstructured P2P network, and it consists of ranked neighbor caching scheme and queryhit caching scheme. The proposed algorithm can extend the search region but reduce the search traffic, and also balance the network load, so that acquires the whole networks scalable.