Work

A scalable content-addressable network

Year: 2001

Type: conference-paper

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 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.

Source: ACM SIGCOMM Conference (SIGCOMM)

DOI: 10.1145/383059.383072

Authors: Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker

Institutions: International Computer Science Institute, University of California, Berkeley, AT&T (United States)

Language: English

Topic: Peer-to-Peer Network Technologies

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2163059190

FWCI: 170.3

Cites: 23

Cited by: 6,409

Related to: 10