[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2002-24 | ||
| Next version(s) | 2003-58 | ||
| Submitted on | 10th of September 2002 | ||
| Author | Ganesan, Prasanna; Sun, Qixiang; Garcia-Molina, Hector | ||
| Title | YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology | ||
| Date of publication | July 2002 | ||
| Published in | Submitted to INFOCOM 2002 | ||
| Citation | Ganesan, Prasanna; Sun, Qixiang; Garcia-Molina, Hector. YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology, Submitted to INFOCOM 2002 | ||
| Number of pages | 12 | ||
| Language | English | ||
| Project | Peers | ||
| Type | Technical Report | ||
| Subject group | Computer Science; 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. | ||
| Keywords | peer-to-peer, distributed hash table, arbitrary topology | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]