A Scalable Content Addressable Network

  • Ratnasamy S
  • Francis P
  • Handley M
 et al. 
  • 171


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


    Citations of this article.


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


  • 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