A scalable content-addressable network

By Sylvia Ratnasamy, Paul Francis, Mark James Handley, Richard M. Karp, Scott Shenker. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2001

7,553 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/680ba806b8a651e8cb2e2d64a9d6bc2325a8eea1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. John Risson
  2. Tim Moors
  3. Ion Stoica
  4. Scott Shenker
  5. Anne-Marie Kermarrec
  6. Hector Garcia-Molina
  7. Peter Druschel
  8. Antony Ian Taylor Rowstron

Citations in the corpus