Ecole d'ingénieur et centre de recherche en Sciences du numérique

Erasure-coded byzantine storage with separate metadata

Androulaki, Elli; Cachin, Christian; Dobre, Dan; Vukolic, Marko

OPODIS 2014, 18th International Conference on Principles of Distributed Systems, December 16-19, 2014, Cortina d?Ampezzo, Italy / Also published in LNCS, Vol. 8878/2014

Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be efficient and incur low cost. We present AWE, the first erasure-coded distributed implementation of a multi-writer multi-reader read/write storage object that is, at the same time: (1) asynchronous, (2) wait-free, (3) atomic, (4) amnesic, (i.e., with data nodes storing a bounded number of values) and (5) Byzantine fault-tolerant (BFT) using the optimal number of nodes. Furthermore, AWE is efficient since it does not use public-key cryptography and requires data nodes that support only reads and writes, further reducing the cost of deployment and ownership of a distributed storage solution. Notably, AWE stores metadata separately from k -out-of-n erasure-coded fragments. This enables AWE to be the first BFT protocol that uses as few as data nodes to tolerate t Byzantine nodes, for any k≥1 .Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consisteAlthough many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be efficient and incur low cost. We present AWE, the first erasure-coded distributed implementation of a multi-writer multi-reader read/write storage object that is, at the same time: (1) asynchronous, (2) wait-free, (3) atomic, (4) amnesic, (i.e., with data nodes storing a bounded number of values) and (5) Byzantine fault-tolerant (BFT) using the optimal number of nodes. Furthermore, AWE is efficient since it does not use public-key cryptography and requires data nodes that support only reads and writes, further reducing the cost of deployment and ownership of a distributed storage solution. Notably, AWE stores metadata separately from k-out-of-n erasure-coded fragments. This enables AWE to be the first BFT protocol that uses as few as 2t+k data nodes to tolerate t Byzantine nodes, for any k≥1. .958Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be efficient and incur low cost. We present AWE, the first erasure-coded distributed implementation of a multi-writer multi-reader read/write storage object that is, at the same time: (1) asynchronous, (2) wait-free, (3) atomic, (4) amnesic, (i.e., with data nodes storing a bounded number of values) and (5) Byzantine fault-tolerant (BFT) using the optimal number of nodes. Furthermore, AWE is efficient since it does not use public-key cryptography and requires data nodes that support only reads and writes, further reducing the cost of deployment and ownership of a distributed storage solution. Notably, AWE stores metadata separately from k-out-of-n erasure-coded fragments. This enables AWE to be the first BFT protocol that uses as few as 2t+k data nodes to tolerate t Byzantine nodes, for any k≥1.

Doi Arxiv Bibtex

Titre:Erasure-coded byzantine storage with separate metadata
Type:Conférence
Langue:English
Ville:Cortina d?Ampezzo
Pays:ITALIE
Date:
Département:Sécurité numérique
Eurecom ref:4230
Copyright: © Springer. Personal use of this material is permitted. The definitive version of this paper was published in OPODIS 2014, 18th International Conference on Principles of Distributed Systems, December 16-19, 2014, Cortina d?Ampezzo, Italy / Also published in LNCS, Vol. 8878/2014 and is available at : http://dx.doi.org/10.1007/978-3-319-14472-6_6
Bibtex: @inproceedings{EURECOM+4230, doi = {http://dx.doi.org/10.1007/978-3-319-14472-6_6}, year = {2014}, title = {{E}rasure-coded byzantine storage with separate metadata}, author = {{A}ndroulaki, {E}lli and {C}achin, {C}hristian and {D}obre, {D}an and {V}ukolic, {M}arko}, booktitle = {{OPODIS} 2014, 18th {I}nternational {C}onference on {P}rinciples of {D}istributed {S}ystems, {D}ecember 16-19, 2014, {C}ortina d?{A}mpezzo, {I}taly / {A}lso published in {LNCS}, {V}ol. 8878/2014}, address = {{C}ortina d?{A}mpezzo, {ITALIE}}, month = {12}, url = {http://www.eurecom.fr/publication/4230} }
Voir aussi: