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

DOI10.1016/S0898-1221(01)00276-0zbMath1002.68013MaRDI QIDQ1609042

Tetz C. Huang, Ji-Cherng Lin

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

shortest pathsdistributed systemself-stabilizing algorithmcentral daemon

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (5)

An efficient fault-containing self-stabilizing algorithm for the shortest path problem ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity ⋮ Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model ⋮ A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Cites Work

• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilizing systems in spite of distributed control

This page was built for publication: A self-stabilizing algorithm for the shortest path problem in a distributed system