Name
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.Should we build Gnutella on a structured overlay? We believe the answer is yes. We replaced the random graph in Gnutella by a structured overlay while retaining the content placement and discovery mechanisms of unstructured overlays to support complex queries. Our preliminary results indicate that we can use structure to improve the performance of floods and rondom walks. They also indicate that structure can be used to reduce maintenance overhead, which is surprising because it is commonly believed that unstructured overlays have lower maintenance overhead than structured overlays. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/972374.972397 | Computer Communication Review |
Keywords | Field | DocType |
random graph,lower maintenance overhead,random walk,data item,structured overlay,unstructured overlay,overlay node,efficient discovery,discovery mechanism,complex query | Graph,Honeypot,Network intrusion detection,Random graph,Protocol analysis,Computer science,Random walk,Computer network,Pattern detection,Overlay,Distributed computing | Journal |
Volume | Issue | ISSN |
34 | 1 | 0146-4833 |
Citations | PageRank | References |
61 | 3.72 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miguel Castro | 1 | 5088 | 328.69 |
| Manuel Costa | 2 | 1589 | 88.62 |
| Antony Rowstron | 3 | 6605 | 542.43 |