Asynchronous and fully self-stabilizing time-adaptive majority consensus

Janna Burman; Ted Herman; Shay Kutten; Boaz Patt-Shamir

doi:10.1007/11795490_13

Asynchronous and fully self-stabilizing time-adaptive majority consensus

Janna Burman^*, Ted Herman, Shay Kutten, Boaz Patt-Shamir

^*Corresponding author for this work

School of Electrical Engineering

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

Abstract

We study the scenario where a batch of transient faults hits an asynchronous distributed system by corrupting the state of some / nodes. We concentrate on the basic majority consensus problem, where nodes are required to agree on a common output value which is the input value of the majority of them. We give a fully self-stabilizing adaptive algorithm, i.e., the output value stabilizes in O(f) time at all nodes, for any unknown f. Moreover, a state stabilization occurs in time proportional to the (unknown) diameter of the network. Both upper bounds match known lower bounds to within a constant factor. Previous results (stated for a slightly less general problem called "persistent bit") assumed the synchronous network model, and that f < n/2.

Original language	English
Title of host publication	Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers
Pages	146-160
Number of pages	15
DOIs	https://doi.org/10.1007/11795490_13
State	Published - 2006
Event	9th International Conference on Principles of Distributed Systems, OPODIS 2005 - Pisa, Italy Duration: 12 Dec 2005 → 14 Dec 2005

Publication series

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

Conference

Conference	9th International Conference on Principles of Distributed Systems, OPODIS 2005
Country/Territory	Italy
City	Pisa
Period	12/12/05 → 14/12/05

Access to Document

10.1007/11795490_13

Cite this

Burman, J., Herman, T., Kutten, S., & Patt-Shamir, B. (2006). Asynchronous and fully self-stabilizing time-adaptive majority consensus. In Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers (pp. 146-160). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3974 LNCS). https://doi.org/10.1007/11795490_13

Burman, Janna ; Herman, Ted ; Kutten, Shay et al. / Asynchronous and fully self-stabilizing time-adaptive majority consensus. Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers. 2006. pp. 146-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c3aa6f173f2b4622beeddfcfebdf53e7,

title = "Asynchronous and fully self-stabilizing time-adaptive majority consensus",

abstract = "We study the scenario where a batch of transient faults hits an asynchronous distributed system by corrupting the state of some / nodes. We concentrate on the basic majority consensus problem, where nodes are required to agree on a common output value which is the input value of the majority of them. We give a fully self-stabilizing adaptive algorithm, i.e., the output value stabilizes in O(f) time at all nodes, for any unknown f. Moreover, a state stabilization occurs in time proportional to the (unknown) diameter of the network. Both upper bounds match known lower bounds to within a constant factor. Previous results (stated for a slightly less general problem called {"}persistent bit{"}) assumed the synchronous network model, and that f < n/2.",

author = "Janna Burman and Ted Herman and Shay Kutten and Boaz Patt-Shamir",

year = "2006",

doi = "10.1007/11795490_13",

language = "אנגלית",

isbn = "3540363211",

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

pages = "146--160",

booktitle = "Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers",

note = "9th International Conference on Principles of Distributed Systems, OPODIS 2005 ; Conference date: 12-12-2005 Through 14-12-2005",

}

Burman, J, Herman, T, Kutten, S & Patt-Shamir, B 2006, Asynchronous and fully self-stabilizing time-adaptive majority consensus. in Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3974 LNCS, pp. 146-160, 9th International Conference on Principles of Distributed Systems, OPODIS 2005, Pisa, Italy, 12/12/05. https://doi.org/10.1007/11795490_13

Asynchronous and fully self-stabilizing time-adaptive majority consensus. / Burman, Janna; Herman, Ted; Kutten, Shay et al.
Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers. 2006. p. 146-160 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3974 LNCS).

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

TY - GEN

T1 - Asynchronous and fully self-stabilizing time-adaptive majority consensus

AU - Burman, Janna

AU - Herman, Ted

AU - Kutten, Shay

AU - Patt-Shamir, Boaz

PY - 2006

Y1 - 2006

N2 - We study the scenario where a batch of transient faults hits an asynchronous distributed system by corrupting the state of some / nodes. We concentrate on the basic majority consensus problem, where nodes are required to agree on a common output value which is the input value of the majority of them. We give a fully self-stabilizing adaptive algorithm, i.e., the output value stabilizes in O(f) time at all nodes, for any unknown f. Moreover, a state stabilization occurs in time proportional to the (unknown) diameter of the network. Both upper bounds match known lower bounds to within a constant factor. Previous results (stated for a slightly less general problem called "persistent bit") assumed the synchronous network model, and that f < n/2.

AB - We study the scenario where a batch of transient faults hits an asynchronous distributed system by corrupting the state of some / nodes. We concentrate on the basic majority consensus problem, where nodes are required to agree on a common output value which is the input value of the majority of them. We give a fully self-stabilizing adaptive algorithm, i.e., the output value stabilizes in O(f) time at all nodes, for any unknown f. Moreover, a state stabilization occurs in time proportional to the (unknown) diameter of the network. Both upper bounds match known lower bounds to within a constant factor. Previous results (stated for a slightly less general problem called "persistent bit") assumed the synchronous network model, and that f < n/2.

UR - http://www.scopus.com/inward/record.url?scp=84870850598&partnerID=8YFLogxK

U2 - 10.1007/11795490_13

DO - 10.1007/11795490_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84870850598

SN - 3540363211

SN - 9783540363217

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

SP - 146

EP - 160

BT - Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers

T2 - 9th International Conference on Principles of Distributed Systems, OPODIS 2005

Y2 - 12 December 2005 through 14 December 2005

ER -

Burman J, Herman T, Kutten S, Patt-Shamir B. Asynchronous and fully self-stabilizing time-adaptive majority consensus. In Principles of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers. 2006. p. 146-160. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11795490_13

Asynchronous and fully self-stabilizing time-adaptive majority consensus

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this