A Scalable Content-Addressable Network

A Scalable Content-Addressable Network (2001)

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

Venue:	IN PROC. ACM SIGCOMM 2001
Citations:	2353 - 29 self

User correction supplied by mph

Datum	Value	Source
TITLE	A Scalable Content-Addressable Network	INFERENCE
AUTHOR NAME	Sylvia Ratnasamy	user correction
AUTHOR AFFIL	Dept. of Electrical Eng. & Comp. Sci.; University of California, Berkeley	user correction
AUTHOR ADDR	Berkeley, CA, USA	user correction
AUTHOR NAME	Paul Francis	user correction
AUTHOR NAME	Mark Handley	user correction
AUTHOR NAME	Richard Karp	user correction
AUTHOR NAME	Scott Shenker	user correction
AUTHOR AFFIL		user correction
AUTHOR ADDR		user correction
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.	user correction
YEAR	2001	INFERENCE
VENUE	IN PROC. ACM SIGCOMM 2001	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	161--172	INFERENCE
CITATIONS	19 found	ParsCit 1.0