Self-stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems

Georgiou, Chryssis; Lundström, Oskar; Schiller, Elad Michael

doi:10.1007/978-3-030-31277-0_8

Cited by 11 publications

(13 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1.4.5 Self-stabilizing non-Byzantine fault-tolerant solutions Lundström, Raynal, and Schiller [58] presented the first self-stabilizing solution for the problem of binary consensus for message-passing systems where nodes may fail by crashing. They ensure a line of self-stabilizing solutions [57,47,46]. This line follows the approach proposed by Dolev, Petig, and Schiller [34,33] for self-stabilization in the presence of seldom fairness.…”

Section: Common Coin Servicesmentioning

confidence: 94%

Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems

Georgiou¹,

Marcoullis²,

Raynal³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Many distributed applications, such as cloud computing, service replication, load balancing, and distributed ledgers, e.g., Blockchain, require the system to solve consensus in which all nodes reliably agree on a single value. Binary consensus, where the set of values that can be proposed is either zero or one, is a fundamental building block for other "flavors" of consensus, e.g., multivalued, or vector, and of total order broadcast. At PODC 2014, Mostéfaoui, Moumen, and Raynal, in short MMR, presented a randomized signature-free asynchronous binary consensus algorithm. They demonstrated that their solution can deal with up to t Byzantine nodes, where t < n/3 and n is the number of nodes. MMR assumes the availability of a common coin service and fair scheduling of message arrivals, which does not depend on the current coin values. It terminates within O(1) expected time.Our study, which focuses on binary consensus, aims at the design of an even more robust consensus protocol. We do so by augmenting MMR with self-stabilization, a powerful notion of fault-tolerance. In addition to tolerating node and communication failures, self-stabilizing systems can automatically recover after the occurrence of arbitrary transient-faults; these faults represent any violation of the assumptions on which the system was designed to operate (provided that the algorithm code remains intact).We present the first loosely-self-stabilizing fault-tolerant asynchronous solution to binary consensus in Byzantine message-passing systems. This is achieved via an instructive transformation of MMR to a self-stabilizing solution that can violate safety requirements with the probability Pr = O(2 −M ), where M ∈ Z + is a predefined constant that can be set to any positive value at the cost of 3M n + log M bits of local memory. The obtained self-stabilizing version of the MMR algorithm considers a far broader fault-model since it recovers from transient faults. Additionally, the algorithm preserves the MMR's properties of optimal resilience and termination, i.e., t < n/3, and O(1) expected decision time. Furthermore, it only requires a bounded amount of memory.

show abstract

Section: Common Coin Servicesmentioning

confidence: 94%

Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems

Georgiou¹,

Marcoullis²,

Raynal³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Georgiou, Lundström, and Schiller studied the trade-off between non-blocking and wait-free solutions for self-stabilizing atomic snapshot objects [24]. We study a similar trade-off for a different problem.…”

Section: Self-stabilizing Solutionsmentioning

confidence: 99%

Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems

Lundström¹,

Raynal²,

Schiller³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes have to uniformly decide on a specific value v ∈ V , where |V | ≥ 2. Existing solutions (that tolerate process failures) reduce the multivalued consensus problem to the one of binary consensus, e.g., Mostéfaoui-Raynal-Tronel and Zhang-Chen.Our study aims at the design of an even more reliable solution. We do so through the lenses of self-stabilization-a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient-faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact).This work proposes the first (to the best of our knowledge) self-stabilizing algorithm for multivalued consensus for asynchronous message-passing systems prone to process failures and arbitrary transient-faults. Our solution is also the first (to the best of our knowledge) to support wait-freedom. Moreover, using piggybacking techniques, our solution can invoke n binary consensus objects concurrently. Thus, the proposed self-stabilizing solution can terminate using fewer binary consensus objects than earlier non-self-stabilizing solutions by Mostéfaoui, Raynal, and Tronel, which uses an unbounded number of binary consensus objects, or Zhang and Chen, which is not wait-free.

show abstract

“…There are other self-stabilizing algorithms that are the result of transformations of non-self-stabilizing yet solutions, such as for atomic snapshots [22], uniform reliable broadcast [33], set-constraint delivery broadcast [34] and coded atomic storage [16].…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, we organize these multivalued consensus objects in an array, CS[], of M elements, where M ∈ Z + is a predefined constant. We note that in case the algorithm that uses CS[] runs out of consensus objects, a global restart procedure can be invoked, such as the one in [22], Section 5. Thus, it is possible to have bounded sequence numbers for multivalued objects.…”

Section: Task Specificationmentioning

confidence: 99%