Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Resource Bounds for Self-Stabilizing Message-Driven Protocols
SIAM Journal on Computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Computing vector functions on anonymous networks
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The local detection paradigm and its applications to self-stabilization
Theoretical Computer Science
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Discrete Mathematics
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On bootstrapping topology knowledge in anonymous networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Duplicate address detection in wireless ad hoc networks using wireless nature
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.01 |
We prove the existence of a "universal" synchronous self-stabilizing protocol, that is, a protocol that allows a distributed system to stabilize to a desired nonreactive behaviour (as long as a protocol stabilizing to that behaviour exists). Previous proposals required drastic increases in asymmetry and knowledge to work, whereas our protocol does not use any additional knowledge, and does not require more symmetry-breaking conditions than available; thus, it is also stabilizing with respect to dynamic changes in the topology. We prove an optimal quiescence time n+D for a synchronous network of n processors and diameter D; the protocol can be made finite state with a negligible loss in quiescence time. Moreover, an optimal D + 1 protocol is given for the case of unique identifiers. As a consequence, we provide an effective proof technique that allows to show whether self-stabilization to a certain behaviour is possible under a wide range of models.