A self-stabilizing algorithm for the shortest path problem in a distributed system

Computers and Mathematics with Applications

Volumn 43, Issue 1-2, 2002, Pages 103-109

  Huang, Tetz C ^a   Lin, Ji Cherng ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Bounded function; Central daemon; Distance; Predecessors; Self stabilizing algorithm; Shortest paths; Turn nodes

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; CONVERGENCE OF NUMERICAL METHODS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; THEOREM PROVING;

BOUNDED FUNCTION TECHNIQUE; CENTRAL DAEMON; PREDECESSORS; SELF STABILIZING ALGORITHM; SHORTEST PATH PROBLEM; TURN NODES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036141574     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(01)00276-0     Document Type: Article

References (6)

1. Self-stabilizing systems in spite of distributed control
2. A self-stabilizing distributed algorithm for single-destination shortest path problem
3. A self-stabilizing algorithm for the shortest paths problem with a fully distributed daemon
4. A self-stabilizing shortest path algorithm in a DAG
5. A self-stabilizing algorithm for shortest path trees
6. A self-stabilizing algorithm for constructing breadth-first trees