Token Systems That Self-Stabilize
IEEE Transactions on Computers
A self-stabilizing algorithm for constructing breadth-first trees
Information Processing Letters
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
Journal of Computer and System Sciences
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
Computers & Mathematics with Applications
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
Computers & Mathematics with Applications
| Hi-index | 0.04 |
The distributed daemon model introduced by Burns in 1987 is a natural generalization of the central daemon model introduced by Dijkstra in 1974. In this paper, we show that a well-known shortest path algorithm is self-stabilizing under the distributed daemon model. Although this result has been proven only recently, the correctness proof provided here is from a different point of view and is much more concise. We also show that Bruell et al.'s center-finding algorithm is actually self-stabilizing under the distributed daemon model. Finally, we compute the worst-case stabilization times of the two algorithms under the distributed daemon model.