When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine

Shlomi Dolev; Ronen I. Kat; Elad M. Schiller

doi:10.1007/11945529_5

When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine

Shlomi Dolev
, Ronen I. Kat
, Elad M. Schiller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

This paper presents a self-stabilizing failure detector, asynchronous consensus and replicated state-machine algorithm suite, the components of which can be started in an arbitrary state and converge to act as a virtual state-machine. Self-stabilizing algorithms can cope with transient faults. Transient faults can alter the system state to an arbitrary state and hence, cause a temporary violation of the safety property of the consensus. New requirements for consensus that fit the on-going nature of self-stabilizing algorithms are presented. The wait-free consensus (and the replicated state-machine) algorithm presented is a classic combination of a failure detector and a (memory bounded) rotating coordinator consensus that satisfy both eventual safety and eventual liveness. Several new techniques and paradigms are introduced. The bounded memory failure detector abstracts away synchronization assumptions using bounded heartbeat counters combined with a balance-unbalance mechanism. The practically infinite paradigm is introduced in the scope of self-stabilization, where an execution of, say, 2⁶⁴ sequential steps is regarded as (practically) infinite. Finally, we present the first self-stabilizing wait-free reset mechanism that ensures eventual safety and can be used in other scopes.

Original language	English
Title of host publication	Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings
Publisher	Springer Verlag
Pages	45-63
Number of pages	19
ISBN (Print)	9783540499909
DOIs	https://doi.org/10.1007/11945529_5
State	Published - 1 Jan 2006
Event	10th International Conference on Principles of Distributed Systems, OPODIS 2006 - Bordeaux, France Duration: 12 Dec 2006 → 15 Dec 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4305 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Principles of Distributed Systems, OPODIS 2006
Country/Territory	France
City	Bordeaux
Period	12/12/06 → 15/12/06

Keywords

Consensus
Distributed Reset
Failure Detector
Self-Stabilization
State-Machine
Wait-Free

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11945529_5

Cite this

Dolev, S., Kat, R. I., & Schiller, E. M. (2006). When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine. In Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings (pp. 45-63). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4305 LNCS). Springer Verlag. https://doi.org/10.1007/11945529_5

Dolev, Shlomi ; Kat, Ronen I. ; Schiller, Elad M. / When consensus meets self-stabilization : Self-stabilizing failure-detector, consensus and replicated state-machine. Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings. Springer Verlag, 2006. pp. 45-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{54a44f5472db48409e4f92e538bf76ab,

title = "When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine",

abstract = "This paper presents a self-stabilizing failure detector, asynchronous consensus and replicated state-machine algorithm suite, the components of which can be started in an arbitrary state and converge to act as a virtual state-machine. Self-stabilizing algorithms can cope with transient faults. Transient faults can alter the system state to an arbitrary state and hence, cause a temporary violation of the safety property of the consensus. New requirements for consensus that fit the on-going nature of self-stabilizing algorithms are presented. The wait-free consensus (and the replicated state-machine) algorithm presented is a classic combination of a failure detector and a (memory bounded) rotating coordinator consensus that satisfy both eventual safety and eventual liveness. Several new techniques and paradigms are introduced. The bounded memory failure detector abstracts away synchronization assumptions using bounded heartbeat counters combined with a balance-unbalance mechanism. The practically infinite paradigm is introduced in the scope of self-stabilization, where an execution of, say, 264 sequential steps is regarded as (practically) infinite. Finally, we present the first self-stabilizing wait-free reset mechanism that ensures eventual safety and can be used in other scopes.",

keywords = "Consensus, Distributed Reset, Failure Detector, Self-Stabilization, State-Machine, Wait-Free",

author = "Shlomi Dolev and Kat, \{Ronen I.\} and Schiller, \{Elad M.\}",

year = "2006",

month = jan,

day = "1",

doi = "10.1007/11945529\_5",

language = "English",

isbn = "9783540499909",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "45--63",

booktitle = "Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings",

address = "Germany",

note = "10th International Conference on Principles of Distributed Systems, OPODIS 2006 ; Conference date: 12-12-2006 Through 15-12-2006",

}

Dolev, S, Kat, RI & Schiller, EM 2006, When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine. in Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4305 LNCS, Springer Verlag, pp. 45-63, 10th International Conference on Principles of Distributed Systems, OPODIS 2006, Bordeaux, France, 12/12/06. https://doi.org/10.1007/11945529_5

When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine. / Dolev, Shlomi; Kat, Ronen I.; Schiller, Elad M.
Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings. Springer Verlag, 2006. p. 45-63 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4305 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - When consensus meets self-stabilization

T2 - 10th International Conference on Principles of Distributed Systems, OPODIS 2006

AU - Dolev, Shlomi

AU - Kat, Ronen I.

AU - Schiller, Elad M.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - This paper presents a self-stabilizing failure detector, asynchronous consensus and replicated state-machine algorithm suite, the components of which can be started in an arbitrary state and converge to act as a virtual state-machine. Self-stabilizing algorithms can cope with transient faults. Transient faults can alter the system state to an arbitrary state and hence, cause a temporary violation of the safety property of the consensus. New requirements for consensus that fit the on-going nature of self-stabilizing algorithms are presented. The wait-free consensus (and the replicated state-machine) algorithm presented is a classic combination of a failure detector and a (memory bounded) rotating coordinator consensus that satisfy both eventual safety and eventual liveness. Several new techniques and paradigms are introduced. The bounded memory failure detector abstracts away synchronization assumptions using bounded heartbeat counters combined with a balance-unbalance mechanism. The practically infinite paradigm is introduced in the scope of self-stabilization, where an execution of, say, 264 sequential steps is regarded as (practically) infinite. Finally, we present the first self-stabilizing wait-free reset mechanism that ensures eventual safety and can be used in other scopes.

AB - This paper presents a self-stabilizing failure detector, asynchronous consensus and replicated state-machine algorithm suite, the components of which can be started in an arbitrary state and converge to act as a virtual state-machine. Self-stabilizing algorithms can cope with transient faults. Transient faults can alter the system state to an arbitrary state and hence, cause a temporary violation of the safety property of the consensus. New requirements for consensus that fit the on-going nature of self-stabilizing algorithms are presented. The wait-free consensus (and the replicated state-machine) algorithm presented is a classic combination of a failure detector and a (memory bounded) rotating coordinator consensus that satisfy both eventual safety and eventual liveness. Several new techniques and paradigms are introduced. The bounded memory failure detector abstracts away synchronization assumptions using bounded heartbeat counters combined with a balance-unbalance mechanism. The practically infinite paradigm is introduced in the scope of self-stabilization, where an execution of, say, 264 sequential steps is regarded as (practically) infinite. Finally, we present the first self-stabilizing wait-free reset mechanism that ensures eventual safety and can be used in other scopes.

KW - Consensus

KW - Distributed Reset

KW - Failure Detector

KW - Self-Stabilization

KW - State-Machine

KW - Wait-Free

UR - https://www.scopus.com/pages/publications/84885771052

U2 - 10.1007/11945529_5

DO - 10.1007/11945529_5

M3 - Conference contribution

AN - SCOPUS:84885771052

SN - 9783540499909

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 45

EP - 63

BT - Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings

PB - Springer Verlag

Y2 - 12 December 2006 through 15 December 2006

ER -

Dolev S, Kat RI, Schiller EM. When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine. In Principles of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings. Springer Verlag. 2006. p. 45-63. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11945529_5

When consensus meets self-stabilization: Self-stabilizing failure-detector, consensus and replicated state-machine

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this