Hybrid search schemes for unstructured peer-to-peer networks

— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead and replication. We consider both regular topologies and topologies with supernodes. We introduce a general search scheme, of which flooding and random walks are special instances, and show how to use locally maintained network information to improve the performance of searching. Our main findings are: (a)A small number of supernodes in an otherwise regular topology can offer sharp savings in the performance of search, both in the case of search by flooding and search by random walk, particularly when it is combined with 1-step replication. We quantify, analytically and experimentally, that the reason of these savings is that the search is biased towards nodes that yield more information. (b)There is a generalization of search, of which flooding and random walk a...

• Type: Conference
• Year: 2005
• Where: INFOCOM
• Authors: Christos Gkantsidis, Milena Mihail, Amin Saberi
• Keywords: Communications, Hybrid Search Schemes, INFOCOM 2005, Random Walk, Search Scheme