A Scalable Content-Addressable Network

TitleA Scalable Content-Addressable Network
Publication TypeJournal Article
Year of Publication2001
AuthorsRatnasamy, S., Francis P., Handley M., Karp R. M., & Shenker S.
Published inACM SIGCOMM Computer Communication Review
Volume31
Issue4
Page(s)161-172
Other Numbers3517
Abstract

Hash tables – which map "keys" onto "values" – are an essential buildingblock in modern software systems. We believe a similar functionality wouldbe equally valuable to large distributed systems. In this paper, we introducethe concept of a Content-Addressable Network (CAN) as a distributedinfrastructure that provides hash table-like functionality on Internet-likescales. The CAN is scalable, fault-tolerant and completely self-organizing,and we demonstrate its scalability, robustness and low-latency propertiesthrough simulation.

URLhttp://www.icsi.berkeley.edu/pubs/networking/scalablecontent01.pdf
Bibliographic Notes

ACM SIGCOMM Computer Communication Review, Vol. 31, No. 4, pp. 161-172

Abbreviated Authors

S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Shenker

ICSI Research Group

Networking and Security

ICSI Publication Type

Article in journal or magazine