Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/INFCOM.2003.1208961 | INFOCOM |
Keywords | Field | DocType |
gnutella-style system,yet another peer-to-peer system,peer-to-peer search network,peer-to-peer lookup service,information retrieval,arbitrary network topology,network topology,controlled flooding,search problems,underlying topology,yappers,internet,distributed hash table,system design,intelligent search mechanism,distributed systems,computer science | Logical topology,Topology,Peer-to-peer,Computer science,Computer network,Network topology,Overlay,The Internet,Distributed hash table,Distributed computing,Traverse,Scalability | Conference |
Volume | ISSN | ISBN |
2 | 0743-166X | 0-7803-7752-4 |
Citations | PageRank | References |
46 | 3.03 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Prasanna Ganesan | 1 | 1167 | 85.68 |
| Qixiang Sun | 2 | 389 | 32.11 |
| Héctor García-Molina | 3 | 24359 | 5652.13 |