Self-stabilizing depth-first token circulation on networks

DOI10.1007/BF02278857zbMath1282.68085OpenAlexW2016115902MaRDI QIDQ1310571

Nian-Shing Chen, Shing-Tsaan Huang

Publication date: 22 November 1995

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

Full work available at URL: https://doi.org/10.1007/bf02278857

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (10)

A self-stabilizing algorithm for strong fairness ⋮ Snap-stabilization and PIF in tree networks ⋮ Self-stabilizing token circulation in uniform networks ⋮ Self-stabilizing depth-first token circulation in arbitrary rooted networks ⋮ Game theoretic analysis of self-stabilizing systems on arrays ⋮ Timer-based composition of fault-containing self-stabilizing protocols ⋮ Request-based token passing for self-stabilizing mutual exclusion ⋮ Stabilizing maximum matching in bipartite networks ⋮ A Framework for Certified Self-Stabilization ⋮ An optimal self-stabilizing strarvation-free alternator

Cites Work

• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization (in spite of distributed control) in tree-structured systems
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Finding Dominators in Directed Graphs
• Self-stabilizing systems in spite of distributed control

This page was built for publication: Self-stabilizing depth-first token circulation on networks