Token Systems That Self-Stabilize
IEEE Transactions on Computers
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
An alternative solution to a problem on self-stabilization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilization by local checking and correction
Self-stabilization by local checking and correction
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The stabilizing token ring in three bits
Journal of Parallel and Distributed Computing
Uniform Dynamic Self-Stabilizing Leader Election
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
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilization with Global Rooted Synchronizers
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A Self-Stabilizing Protocol for Pipelined PIF in Tree Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Snap-Stabilizing PIF Algorithm in Arbitrary Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in zero steps. In this paper, we first prove the number of states required on processors to design a snap-stabilizing Propagation of Information with Feedback (PIF) algorithm in arbitrary un-oriented trees running under any distributed daemon (four states per processor for the middle processors and two states for each of the two extreme end processors). Then, we propose two snap-stabilizing PIF algorithms for un-oriented trees. The former works under any (fair or unfair, central or distributed) daemon. It matches the lower bound in terms of number of states we established in this paper. The latter works under any (fair or unfair) central daemon. It uses only three states for the internal processors (two states for the root and the leaves). It is optimal in terms of number of states assuming a central daemon. Thus, both algorithms are optimal both in terms of the stabilization time (zero steps) and state requirement per processor.