Request-based token passing for self-stabilizing mutual exclusion

DOI10.1016/J.INS.2005.11.013MaRDI QIDQ2509211zbMATH OpenOpenAlexFDO

Authors 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

dynamic BFS spanning treemutual exclusionrequest-based protocolself-stabilizationtoken passing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090634
• A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
• SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
• scientific article; zbMATH DE number 1304098
• Self-stabilizing token circulation on asynchronous uniform unidirectional rings

Cites work

• A self-stabilizing algorithm for constructing breadth-first trees
• Efficient token-based control in rings.
• scientific article; zbMATH DE number 1696677 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Self-stabilizing depth-first token circulation in arbitrary rooted networks
• Self-stabilizing depth-first token circulation on networks

Cited in

(2)

• Ad hoc distributed mutual exclusion algorithm based on token-asking
• Timer-based composition of fault-containing self-stabilizing protocols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2509211)