A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Towards a scalable and robust DHT
2006
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a distributed hash table (or DHT). DHTs are based on the concept of virtual space. Peers and data items are mapped to points in that space, and local-control rules are used to decide, based on these virtual locations, how to interconnect the peers and how to map the data to the peers. DHTs are known to be highly scalable and
doi:10.1145/1148109.1148163
dblp:conf/spaa/AwerbuchS06
fatcat:dzclxgmunnff7ca6rzkanzch5u