DOI: 10.1145/964723.383072 ISSN:

A scalable content-addressable network

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
  • Computer Networks and Communications
  • Software

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.

More from our Archive