Journal article

A Scalable Content Addressable Network

Ratnasamy S, Francis P, Handley M, Karp R, Shenker S ...see all

Proc of ACM SIGCOMM, vol. TR-00-010 (2000) pp. 161-172

  • 164

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.
  • N/A

    Views

    ScienceDirect users who have downloaded this article.
Sign in to save reference

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 ContentAddressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN design is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability,...

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Sylvia Ratnasamy

  • Paul Francis

  • Mark Handley

  • Richard Karp

  • Scott Shenker

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free