A Scalable Content-Addressable Network

DMCA

A Scalable Content-Addressable Network (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Shenker

Venue:	IN PROC. ACM SIGCOMM 2001
Citations:	3369 - 32 self

BibTeX

@INPROCEEDINGS{Ratnasamy01ascalable,
    author = {Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker},
    title = {A Scalable Content-Addressable Network},
    booktitle = {IN PROC. ACM SIGCOMM 2001},
    year = {2001},
    pages = {161--172},
    publisher = {}
}

OpenURL

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.

Keyphrases

scalable content-addressable network large distributed system hash table-like functionality low-latency property modern software system essential building block hash table content-addressable network internet-like scale distributed infrastructure similar functionality

DMCA