A scalable content-addressable network

  • Authors:
  • Sylvia Ratnasamy;Paul Francis;Mark Handley;Richard Karp;Scott Shenker

  • Affiliations:
  • Dept. of Electrical Eng. & Comp. Sci., University of California at Berkeley, Berkeley, CA and ACIRI, AT&T Center for Internet Research at ICSI, Berkeley, CA;ACIRI, AT&T Center for Internet Research at ICSI, Berkeley, CA;ACIRI, AT&T Center for Internet Research at ICSI, Berkeley, CA;Dept. of Electrical Eng. & Comp. Sci., University of California at Berkeley, Berkeley, CA and ACIRI, AT&T Center for Internet Research at ICSI, Berkeley, CA;ACIRI, AT&T Center for Internet Research at ICSI, Berkeley, CA

  • Venue:
  • Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.04

Visualization

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 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.