| Available via | http://dbpubs.stanford.edu/pub/2003-58 |
| Previous version | 2002-24 |
|
Submitted on |
14th of August 2003 |
|
Author |
Ganesan, Prasanna; Sun, Qixiang; Garcia-Molina, Hector |
|
Title |
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology |
|
Date of publication |
2003 |
|
Published in |
Infocom 2003 |
|
Citation |
Ganesan, Prasanna; Sun, Qixiang; Garcia-Molina, Hector. YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology, Infocom 2003 |
|
Number of pages |
11 |
|
Language |
English |
|
Project |
Peers |
|
Type |
Conference or Journal Paper |
|
Subject group |
Distributed Systems |
|
Abstract |
Existing peer-to-peer search networks generally fall into
two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and systems that explicitly build an underlying topology
to efficiently support a distributed hash table (DHT). In
this paper, we propose a hybrid scheme for building a peer-to-peer lookup service over arbitrary network topology. Specifically, for each node in the search network,
we build a small DHT consisting of nearby nodes and then provide an intelligent search mechanism that can traverse all the small DHTs. Our hybrid approach can reduce the nodes contacted for a lookup by an order of magnitude compared to Gnutella, allows rapid searching of nearby
nodes through quick fan-out, does not reorganize the underlying overlay, and isolates the effect of topology changes to small areas for better scalability and stability. |
| Fulltext source |
Postscript (ps, ps.gz, ps.zip)
PDF (pdf, pdf.gz, pdf.zip)
| Management of the document by | siroker@db.stanford.edu
| |