SSS 2014, 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, September 28-October 1, Paderborn, Germany / Also published in LNCS Vol. 8756/2014
The overhead of Byzantine fault tolerant (BFT) storage is a primary concern that prevents its adoption in practice. The cost stems from the need to maintain at least 3 t +1 copies of the data at different storage replicas in the asynchronous model, so that t Byzantine replica faults can be tolerated. This paper presents MDStore, the first fully asynchronous BFT storage protocol that reduces the number of replicas that store the payload data to as few as 2t + 1 and maintains metadata at 3t + 1 replicas on (possibly) different servers. At the heart of MDStore lies a metadata service built upon a new abstraction called "times-tamped storage." Timestamped storage allows for conditional writes (facilitating the implementation of the metadata service) and has consensus number one (making it implementable with wait-free semantics in an asynchronous system despite faults). In addition to its low replication overhead, MDStore offers strong guarantees by emulating a multi-writer multi-reader atomic register, providing wait free termination, and tolerating any number of Byzantine readers and crash-faulty writers
Type:
Conférence
City:
Paderborn
Date:
2014-09-28
Department:
Sécurité numérique
Eurecom Ref:
4413
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in SSS 2014, 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, September 28-October 1, Paderborn, Germany / Also published in LNCS Vol. 8756/2014 and is available at : http://dx.doi.org/10.1007/978-3-319-11764-5_1
