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
CITATION STYLE
Burman, J., Herman, T., Kutten, S., & Patt-Shamir, B. (2006). Asynchronous and fully self-stabilizing time-adaptive majority consensus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3974 LNCS, pp. 146–160). https://doi.org/10.1007/11795490_13
Mendeley helps you to discover research relevant for your work.