作者
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
发表日期
2001/10/1
期刊
ACM SIGCOMM Computer Communication Review
卷号
31
期号
4
页码范围
161-172
出版商
ACM
简介
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.
引用总数
20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202463310647958110410721088928893789629459423316249213167114768763624519
学术搜索中的文章