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.

Keywords

Computer scienceScalabilityDistributed hash tableDistributed computingHash tableHash functionRobustness (evolution)Fault toleranceLatency (audio)Computer networkThe InternetDatabaseOperating systemComputer security

Affiliated Institutions

Related Publications

Chord

Ion Stoica , Robert Morris , David R. Karger +2 more

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed loo...

2001 9645 citations

Publication Info

Year
2001
Type
article
Pages
161-172
Citations
6374
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

6374
OpenAlex

Cite This

Sylvia Ratnasamy, Paul Francis, Mark Handley et al. (2001). A scalable content-addressable network. , 161-172. https://doi.org/10.1145/383059.383072

Identifiers

DOI
10.1145/383059.383072