Show simple item record

dc.contributor.authorRodrigues, Rodrigo
dc.contributor.authorLiskov, Barbara H.
dc.contributor.authorChen, Kathryn
dc.contributor.authorLiskov, Moses
dc.contributor.authorSchultz, David
dc.date.accessioned2012-08-15T13:10:09Z
dc.date.available2012-08-15T13:10:09Z
dc.date.issued2010-09
dc.date.submitted2010-01
dc.identifier.issn1545-5971
dc.identifier.urihttp://hdl.handle.net/1721.1/72134
dc.description.abstractByzantine-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.en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/tdsc.2010.52en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceOther University Web Domainen_US
dc.titleAutomatic Reconfiguration for Large-Scale Reliable Storage Systemsen_US
dc.typeArticleen_US
dc.identifier.citationRodrigues, Rodrigo et al. “Automatic Reconfiguration for Large-Scale Reliable Storage Systems.” IEEE Transactions on Dependable and Secure Computing 9.2 (2010): 145–158.en_US
dc.contributor.departmentMassachusetts Institute of Technology. System Design and Management Programen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.approverLiskov, Barbara H.
dc.contributor.mitauthorLiskov, Barbara H.
dc.contributor.mitauthorChen, Kathryn
dc.contributor.mitauthorSchultz, David
dc.relation.journalIEEE Transactions on Dependable and Secure Computingen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsRodrigues, Rodrigo; Liskov, Barbara; Chen, Kathryn; Liskov, Moses; Schultz, Daviden
dc.identifier.orcidhttps://orcid.org/0000-0002-5914-1866
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record