Self-stabilizing extensions for message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Resource bounds for self stabilizing message driven protocols
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Fault-local distributed mending (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
An exercise in fault-containment: self-stabilizing leader election
Information Processing Letters
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Asynchronous time-adaptive self stabilization
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilization
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
IEEE Transactions on Computers
Memory-Efficient Self Stabilizing Protocols for General Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Parallel composition of stabilizing algorithms
ICDCS '99 Workshop on Self-stabilizing Systems
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Fault-Local Stabilization: The Shortest Path Tree
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Stability-Oriented Approach to Improving BGP Convergence
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Improved BGP convergence via ghost flushing
IEEE Journal on Selected Areas in Communications
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Learning distributed bayesian network structure using majority-based method
Journal of Computational Methods in Sciences and Engineering
Stabilization in dynamic systems with varying equilibrium
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Adaptive containment of time-bounded byzantine faults
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
We study the scenario where a batch of transient faults hits an asynchronous distributed system by corrupting the state of some f 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 fn/2.