Asynchronous and fully self-stabilizing time-adaptive majority consensus

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationPrinciples of Distributed Systems - 9th International Conference, OPODIS 2005, Revised Selected Papers
Number of pages15
StatePublished - 2006
Event9th International Conference on Principles of Distributed Systems, OPODIS 2005 - Pisa, Italy
Duration: 12 Dec 200514 Dec 2005

Publication series

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


Conference9th International Conference on Principles of Distributed Systems, OPODIS 2005


Dive into the research topics of 'Asynchronous and fully self-stabilizing time-adaptive majority consensus'. Together they form a unique fingerprint.

Cite this