A scalable Content-Addressable Network

Hash tables - which map "keys" onto "values" - are an essential building bl ock 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 infras tructure that provides hash table-like functionality on Internet-like scale s. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties throu gh simulation.