Towards a Scalable and Robust DHT |
| |
Authors: | Baruch Awerbuch Christian Scheideler |
| |
Affiliation: | (1) Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA;(2) Institute for Computer Science, Technical University of Munich, Boltzmannstr. 3, 85748 Garching, Germany |
| |
Abstract: | 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 easy to update as peers enter and leave the system. It is relatively easy to extend
the DHT concept so that a constant fraction of faulty peers can be handled without any problems, but handling adversarial
peers is very challenging. The biggest threats appear to be join-leave attacks (i.e., adaptive join-leave behavior by the
adversarial peers) and attacks on the data management level (i.e., adaptive insert and lookup attacks by the adversarial peers)
against which no provably robust mechanisms are known so far. Join-leave attacks, for example, may be used to isolate honest
peers in the system, and attacks on the data management level may be used to create a high load-imbalance, seriously degrading
the correctness and scalability of the system.
We show, on a high level, that both of these threats can be handled in a scalable manner, even if a constant fraction of the
peers in the system is adversarial, demonstrating that open systems for scalable distributed data storage that are robust
against even massive adversarial behavior are feasible.
Supported by NSF-ANIR 0240551, NSF-CCF 0515080, and NSF-CCR 0311795. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|