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

CiteSeerX logo

DMCA

A Scalable Content-Addressable Network (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.ic.unicamp.br]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.imit.kth.se]
  • [www.csl.mtu.edu]
  • [web.cs.dal.ca]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.tribler.org]
  • [www.ic.unicamp.br]
  • [www.cs.utexas.edu]
  • [web.cs.dal.ca]
  • [www.cl.cam.ac.uk]
  • [www.cs.sjtu.edu.cn]
  • [cgi.di.uoa.gr]
  • [www.mathcs.emory.edu]
  • [www.ovmj.org]
  • [www.cs.rutgers.edu]
  • [www-kiv.zcu.cz]
  • [www-kiv.zcu.cz]
  • [www-inf.int-evry.fr]
  • [www.ece.uc.edu]
  • [pompone.cs.ucsb.edu]
  • [graal.ens-lyon.fr]
  • [www-inf.int-edu.eu]
  • [graal.ens-lyon.fr]
  • [www-inf.it-sudparis.eu]
  • [www.utdallas.edu]
  • [www.utdallas.edu]
  • [graal.ens-lyon.fr]
  • [www.utdallas.edu]
  • [citeseerx.ist.psu.edu]
  • [www.ece.uc.edu]
  • [pompone.cs.ucsb.edu]
  • [www-inf.int-edu.eu]
  • [cosy.univ-reims.fr]
  • [www.cs.ust.hk]
  • [graal.ens-lyon.fr]
  • [www.icir.org]
  • [www.aciri.org]
  • [www-db.in.tum.de]
  • [www.cs.bgu.ac.il]
  • [www.cs.bgu.ac.il]
  • [www.cs.bgu.ac.il]
  • [www.cs.berkeley.edu]
  • [www.icir.org]
  • [http.icsi.berkeley.edu]
  • [www.icsi.berkeley.edu]
  • [robotics.eecs.berkeley.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Shenker
Venue:IN PROC. ACM SIGCOMM 2001
Citations:3369 - 32 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Ratnasamy01ascalable,
    author = {Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker},
    title = {A Scalable Content-Addressable Network},
    booktitle = {IN PROC. ACM SIGCOMM 2001},
    year = {2001},
    pages = {161--172},
    publisher = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.

Keyphrases

scalable content-addressable network    large distributed system    hash table-like functionality    low-latency property    modern software system    essential building block    hash table    content-addressable network    internet-like scale    distributed infrastructure    similar functionality   

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