TY - GEN
T1 - Stabilizing server-based storage in Byzantine asynchronous message-passing systems
AU - Bonomi, Silvia
AU - Dolev, Shlomi
AU - Potop-Butucaru, Maria
AU - Raynal, Michel
N1 - Publisher Copyright:
© Copyright 2015 ACM.
PY - 2015/7/21
Y1 - 2015/7/21
N2 - A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering in- versions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single- writer multi-reader (SWMR) atomic register is then ob- Tained by using several copies of SWSR atomic registers. Fi- nally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of n servers imple- menting an atomic register, and in addition to transient fail- ures, the constructions tolerate t < n/8 Byzantine servers if communication is asynchronous, and t < n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asyn- chronous servers prone to transient failures, and where up to t of them can be Byzantine.
AB - A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering in- versions are eliminated by the use of a (bounded) sequence number for writes, obtaining a practically stabilizing SWSR atomic register. A practically stabilizing Byzantine single- writer multi-reader (SWMR) atomic register is then ob- Tained by using several copies of SWSR atomic registers. Fi- nally, bounded time-stamps, with a time-stamp per writer, together with SWMR atomic registers, are used to construct a practically stabilizing Byzantine multi-writer multi-reader (MWMR) atomic register. In a system of n servers imple- menting an atomic register, and in addition to transient fail- ures, the constructions tolerate t < n/8 Byzantine servers if communication is asynchronous, and t < n/3 Byzantine servers if it is synchronous. The noteworthy feature of the proposed algorithms is that (to our knowledge) these are the first that build an atomic read/write storage on top of asyn- chronous servers prone to transient failures, and where up to t of them can be Byzantine.
KW - Asynchronous message-passing system
KW - Atomic read/write register
KW - Byzantine server
KW - Clients/servers archi- Tecture
KW - Distributed algorithm
KW - Fault-tolerance
KW - Read/write register
KW - Regular register
KW - Self-stabilization
KW - Transient failures
UR - https://www.scopus.com/pages/publications/84957665934
U2 - 10.1145/2767386.2767441
DO - 10.1145/2767386.2767441
M3 - Conference contribution
AN - SCOPUS:84957665934
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 471
EP - 479
BT - PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery
T2 - ACM Symposium on Principles of Distributed Computing, PODC 2015
Y2 - 21 July 2015 through 23 July 2015
ER -