Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
A self-stabilizing algorithm for constructing spanning trees
Information Processing Letters
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
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
Self-stabilization by counter flushing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
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
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
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Snap-Stabilizing PIF and Useless Computations
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Optimal snap-stabilizing PIF algorithms in un-oriented trees
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
An optimal snap-stabilizing wave algorithm in arbitrary graphs
Computer Communications
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
An improved snap-stabilizing PIF algorithm
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A local self-stabilizing enumeration algorithm
DAIS'06 Proceedings of the 6th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
A new polynomial silent stabilizing spanning-tree construction algorithm
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Abstract: We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a pre-constructed spanning tree. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to behave according to its specification. Every PIF wave initiated by the root inherently creates a tree in the graph. So, the tree is dynamically created according to the progress of the PIF wave. This allows our PIF algorithm to take advantage of the relative speed of different components of the network. The proposed algorithm can be easily used to implement any self-stabilizing system which requires a (self-stabilizing) wave protocol running on an arbitrary network.