A Scalable Content-Addressable Network (2001)
Cached
Download Links
| Venue: | In Proceedings of ACM SIGCOMM |
| Citations: | 2353 - 29 self |
BibTeX
@INPROCEEDINGS{Ratnasamy01ascalable,
author = {Sylvia Ratnasamy and Paul Francis and Scott Shenker and Richard Karp and Mark Handley},
title = {A Scalable Content-Addressable Network},
booktitle = {In Proceedings of ACM SIGCOMM},
year = {2001},
pages = {161--172}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
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 Internetlike scales. The CAN design is scalable, fault-tolerant and completely selforganizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.
