Automatic Reconfiguration for Large-Scale Reliable Storage Systems
Name
Liskov_Automatic reconfiguration.pdf
Size
229.63 KB
Format
Adobe PDF
Checksum (MD5)
493e4b93337d03aade4bfbb3bd98d208
Author(s)
Rodrigues, Rodrigo
Liskov, Barbara H.
Chen, Kathryn
Liskov, Moses
Schultz, David
Date Issued
September 2010
Journal
IEEE Transactions on Dependable and Secure Computing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Rodrigues, Rodrigo et al. “Automatic Reconfiguration for Large-Scale Reliable Storage Systems.” IEEE Transactions on Dependable and Secure Computing 9.2 (2010): 145–158.
Version
Author's final manuscript
Abstract
Byzantine-fault-tolerant replication enhances the availability and reliability of Internet services that store critical state and preserve it despite attacks or software errors. However, existing Byzantine-fault-tolerant storage systems either assume a static set of replicas, or have limitations in how they handle reconfigurations (e.g., in terms of the scalability of the solutions or the consistency levels they provide). This can be problematic in long-lived, large-scale systems where system membership is likely to change during the system lifetime. In this paper, we present a complete solution for dynamically changing system membership in a large-scale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. The membership service runs mostly automatically, to avoid human configuration errors; is itself Byzantine-fault-tolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. We demonstrate the utility of this membership service by using it in a novel distributed hash table called dBQS that provides atomic semantics even across changes in replica sets. dBQS is interesting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from previous DHTs by providing Byzantine fault tolerance and offering strong semantics. We implemented the membership service and dBQS. Our results show that the approach works well, in practice: the membership service is able to manage a large system and the cost to change the system membership is low.
MIT Department
Massachusetts Institute of Technology. System Design and Management Program
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tdsc.2010.52
