An efficient fault-containing self-stabilizing algorithm for the shortest path problem

DOI10.1007/S00446-006-0001-1zbMath1266.05166OpenAlexW2068470047MaRDI QIDQ1954198

Tetz C. Huang

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0001-1

zbMATH Keywords

shortest path problemself-stabilizing algorithmstabilization timefault-containmentsingle-fault situation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Fault-containing self-stabilization in asynchronous systems with constant fault-gap ⋮ 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

• An exercise in fault-containment: Self-stabilizing leader election
• A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
• A belated proof of self-stabilization
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization of dynamic systems assuming only read/write atomicity
• A self-stabilizing algorithm for the shortest path problem in a distributed system
• Fault-containing self-stabilizing distributed protocols
• A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
• Fault-containing self-stabilizing algorithms
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• Distributed error confinement

This page was built for publication: An efficient fault-containing self-stabilizing algorithm for the shortest path problem