• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Should we build Gnutella on a structured overlay?

Cached

  • Download as a PDF

Download Links

  • [nms.lcs.mit.edu]
  • [conferences.sigcomm.org]
  • [www.distcomp.ethz.ch]
  • [disco.ethz.ch]
  • [dcg.ethz.ch]
  • [distcomp.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.ic.unicamp.br]
  • [www.ic.unicamp.br]
  • [www.research.microsoft.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Miguel Castro , Manuel Costa , Antony Rowstron
Citations:73 - 0 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Castro_shouldwe,
    author = {Miguel Castro and Manuel Costa and Antony Rowstron},
    title = {Should we build Gnutella on a structured overlay?},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

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.

Keyphrases

data item    random graph    specific node    structured overlay    overlay node    random walk    complex query    much interest    efficient discovery   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University