CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2003-52
Submitted on 1st of August 2003
Author Yang, Beverly; Vinograd, Patrick; Garcia-Molina, Hector
Title Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
Date of publication 1st of August 2003
Citation Yang, Beverly; Vinograd, Patrick; Garcia-Molina, Hector. Evaluating GUESS and Non-Forwarding Peer-to-Peer Search,
Number of pages 10
Language English
Project Peers
Type Preprint
Subject group Miscellaneous
Abstract 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.
Keywords Peer-to-Peer, GUESS
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Management of the document bysiroker@db.stanford.edu


    Stanford InfoLab Publication Server