Request-based token passing for self-stabilizing mutual exclusion

DOI10.1016/J.INS.2005.11.013zbMath1102.68392OpenAlexW2013402399MaRDI QIDQ2509211

Jun Kiniwa

Publication date: 19 October 2006

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2005.11.013

zbMATH Keywords

mutual exclusionself-stabilizationtoken passingdynamic BFS spanning treerequest-based protocol

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

Timer-based composition of fault-containing self-stabilizing protocols

Cites Work

• Unnamed Item
• Unnamed Item
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilizing depth-first token circulation on networks
• Efficient token-based control in rings.
• Self-stabilizing depth-first token circulation in arbitrary rooted networks

This page was built for publication: Request-based token passing for self-stabilizing mutual exclusion