A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Memory efficient, self-stabilizing algorithm to construct BFS spanning trees
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
Snap-Stabilizing PIF and Useless Computations
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Snap-Stabilizing Depth-First Search on Arbitrary Networks
The Computer Journal
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
From self- to snap- stabilization
SSS'06 Proceedings of the 8th 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
A snap-stabilizing DFS with a lower space requirement
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Self-stabilization with r-operators revisited
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Snap-stabilizing depth-first search on arbitrary networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
The first fully polynomial stabilizing algorithm for BFS tree construction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
In this article, we show that some fundamental self- and snap-stabilizing wave protocols (e.g., token circulation, PIF, etc.) implicitly assume a very light property that we call BreakingIn. We prove that BreakingIn is strictly induced by self- and snap-stabilization. Combined with a transformer, BreakingIn allows to easily turn the non-fault-tolerant versions of those protocols into snap-stabilizing versions. Unlike the previous solutions, the transformed protocols are very efficient and work at least with the same daemon as the initial versions extended to satisfy BreakingIn. Finally, we show how to use an additional property of the transformer to design snap-stabilizing extensions of those fundamental protocols like Mutual Exclusion.