Conference Program

Program At A Glance   Tutorials Program  Technical Program  Outrageous Opinions Session  
Social Events

Technical Program

A Scalable Content-Addressable Network
Sylvia Ratnasamy (University of California at Berkeley and ACIRI), Paul Francis (Tahoe Networks), Mark Handley (ACIRI), Richard Karp (U.C. Berkeley and ACIRI), Scott Shenker (ACIRI)

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.

Papers are provided as a service to all by the members of ACM SIGCOMM.

This paper is available in Adobe PDF format.

Last Modified: May 9, 2001