A belated proof of self-stabilization
Distributed Computing
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 systems in spite of distributed control
Communications of the ACM
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
Computers & Mathematics with Applications
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
Discrete Applied Mathematics
Quasi-self-stabilization of a distributed system assuming read/write atomicity
Computers & Mathematics with Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
The Worst-Case Stabilization Time of a Self-Stabilizing Algorithm under the Weakly Fair Daemon Model
International Journal of Artificial Life Research
| Hi-index | 0.09 |
Shortest path finding has a variety of applications in transportation and communication.In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The previous works on this topic had two assumptions that can be relaxed in this paper. First, in the previous works, the systems were assumed to be integral-weighted, whereas in this paper, the systems are real-weighted. Second, and more importantly, the previous works have shown that the algorithm is self-stabilizing under the more restricted central demon model, whereas in this paper, we give a rigorous proof showing that the algorithm is actually self-stabilizing under the more general distributed demon model. The work in this paper is of significance because in the existing literature on self-stabilizing systems, most of the papers regarding the distributed demon are for the ring networks only; there are very few papers that discuss the self-stabilizing algorithms for the general distributed systems assuming the distributed demon model.