Loading...
Please wait, while we are loading the content...
Similar Documents
A Scalable Content-Addressable Network (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ratnasamy, Sylvia Francis, Paul Shenker, Scott Karp, Richard Handley, Mark |
| Description | 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 Internetlike scales. The CAN design is scalable, fault-tolerant and completely selforganizing, and we demonstrate its scalability, robustness and low-latency properties through simulation. In Proceedings of ACM SIGCOMM |
| File Format | |
| Language | English |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Internetlike Scale Similar Functionality Hash Table-like Functionality Scalable Content-addressable Network Modern Software System Hash Table Distributed Infrastructure Essential Building Block Low-latency Property Large Distributed System Content-addressable Network |
| Content Type | Text |
| Resource Type | Article |
