Self-stabilizing token circulation in uniform networks

DOI10.1007/s004460050035zbMath1448.68047OpenAlexW1977130605MaRDI QIDQ5137340

Shing-Tsaan Huang, Lih-Chyau Wuu

Publication date: 2 December 2020

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

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

zbMATH Keywords

fault-toleranceself-stabilizationspanning treestoken circulationuniform networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items

Maximum metric spanning tree made Byzantine tolerant

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
• 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 systems in spite of distributed control
• Token systems that self-stabilize

This page was built for publication: Self-stabilizing token circulation in uniform networks