Should we build Gnutella on a structured overlay?
Cached
Download Links
- [nms.lcs.mit.edu]
- [www.distcomp.ethz.ch]
- [disco.ethz.ch]
- [dcg.ethz.ch]
- [distcomp.ethz.ch]
- [www.dcg.ethz.ch]
- [www.research.microsoft.com]
- DBLP
Other Repositories/Bibliography
by
Miguel Castro
,
Manuel Costa
,
Antony Rowstron
| Citations: | 56 - 0 self |
BibTeX
@MISC{Castro_shouldwe,
author = {Miguel Castro and Manuel Costa and Antony Rowstron},
title = {Should we build Gnutella on a structured overlay?},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on the graph to discover data stored by overlay nodes. Structured overlays assign keys to data items and build a graph that maps each key to a specific node. The structure of the graph enables efficient discovery of data items given their keys but it does not support complex queries.
