Clouder: a flexible large scale decentralized object store: architecture overview
Proceedings of the Third Workshop on Dependable Distributed Data Management
Peer-to-peer single hop distributed hash tables
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A correlation-aware data placement strategy for key-value stores
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
SEERDIS: a DHT-based resource indexing and discovery scheme for the data center
Proceedings of the 19th High Performance Computing Symposia
| Hi-index | 0.00 |
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few seconds or minutes. However, in giant internet data centers, each node has a lifetime of weeks or months and initiates hundreds or thousands of lookups every second. In such an environment, one-hop DHTs are superior to multi-hop DHTs. They use lookup bandwidth more efficiently. We qualify conflicting research to show that a single onehop DHT can indeed scale to at least a few hundred thousand nodes in stable, high-capacity enterprise networks. Two new designs are presented: One Hop Sites (1HS), a high-capacity DHT tailored for site redundancy; and the One Hop Federation (1HF), a global, hierarchic DHT that resolves an open latency problem. For both, the analysis a) confirms linear scalability to at least a few hundred thousand nodes and b) identifies the most sensitive design parameters.