Self-stabilizing depth-first token circulation in arbitrary rooted networks

DOI10.1007/PL00008919zbMath1448.68041MaRDI QIDQ5137905

Vincent Villain, Ajoy K. Datta, Franck Petit, Colette Johnen

Publication date: 3 December 2020

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

zbMATH Keywords

spanning treeself-stabilizationdistributed mutual exclusiontoken passing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

Maintaining balanced trees for structured distributed streaming systems ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ Game theoretic analysis of self-stabilizing systems on arrays ⋮ Snap-Stabilizing Waves in Anonymous Networks ⋮ Request-based token passing for self-stabilizing mutual exclusion ⋮ An optimal self-stabilizing strarvation-free alternator ⋮ Safe and stabilizing distributed multi-path cellular flows

Cites Work

• Unnamed Item
• Self-stabilization (in spite of distributed control) in tree-structured systems
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first token circulation on networks
• Self-stabilizing depth-first search
• The stabilizing token ring in three bits
• Self-stabilizing systems in spite of distributed control
• Self-stabilizing multi-token rings
• Token systems that self-stabilize