A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

Authors:
Tetz C. Huang
Affiliations:
Department of Computer Engineering and Science, Yuan-Ze University 135 Yuan-Tung Rd., Chung-Li Taoyuan 32026, Taiwan
Venue:
Journal of Computer and System Sciences
Year:
2005

Citing 6
Cited 5

A belated proof of self-stabilization

Distributed Computing
A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

SIAM Journal on Computing
Self-stabilization

Self-stabilization
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

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 algorithm for the shortest path problem assuming the distributed demon

Computers & Mathematics with Applications
Self-stabilization

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shortest path finding has a variety of applications in the areas of transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm that solves the single-source shortest path problem for a distributed system. Unlike all previous works on this topic, the model of computation employed by the system in this paper assumes the separate read/write atomicity introduced by Dolev et al. instead of the commonly used composite read/write atomicity introduced by Dijkstra.