%0 Report
%9 Working Paper
%A Yang, Beverly
%A Vinograd, Patrick
%A Garcia-Molina, Hector
%D 2003
%F ilprints:611
%I Stanford InfoLab
%K Peer-to-Peer, GUESS
%T Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
%U http://ilpubs.stanford.edu:8090/611/
%X Current search techniques over unstructured peer-to-peer networks rely on intelligent forwarding-based techniques to propagate queries to other peers in the network.  Forwarding techniques are attractive because they typically require little state and offer robustness to peer failures; however they have inherent performance drawbacks due to the overhead of forwarding and lack of central control. In this paper, we study GUESS, a non-forwarding search mechanism, as a viable alternative to currently popular forwarding-based mechanisms.  We show how non-forwarding mechanisms can be over an order of magnitude more efficient than forwarding mechanisms; however, they must be deployed with care, as a naive implementation can reduce in highly suboptimal performance, and make them susceptible to hotspots and misbehaving peers.