A scalable Content-Addressable Network

被引：828

作者：

Ratnasamy, S ^{[1
]}

Francis, P

Handley, M

Karp, R

Shenker, S

机构：

[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA

[2] AT&T Labs Res, Ctr Internet Res, ICSI, ACIRI, Berkeley, CA USA

来源：

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW | 2001年 / 31卷 / 04期

关键词：

D O I：

10.1145/964723.383072

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Hash tables - which map "keys" onto "values" - are an essential building block in modem software systems. We believe a similar functionality would be equally valuable to large distributed systems. In thiss 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.

引用

页码：161 / 172

页数：12