A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
From MaRDI portal
Publication:815255
DOI10.1016/j.camwa.2005.05.002zbMath1090.90007MaRDI QIDQ815255
Publication date: 16 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.05.002
shortest path problem; self-stabilizing algorithm; bounded function technique; distributed demon; real-weighted system
90B18: Communication networks in operations research
90B06: Transportation, logistics and supply chain management
Related Items
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model, Quasi-self-stabilization of a distributed system assuming read/write atomicity, An efficient fault-containing self-stabilizing algorithm for the shortest path problem, A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
Cites Work
- Unnamed Item
- 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
- An efficient fault-containing self-stabilizing algorithm for the shortest path problem
- The alternator
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
- Self-stabilizing systems in spite of distributed control
- A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
- Token systems that self-stabilize