Self-stabilizing token circulation on asynchronous uniform unidirectional rings

DOI10.1145/343477.343626zbMath1314.68387OpenAlexW2001665157MaRDI QIDQ5176786

Laurent Rosaz

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343626

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Effective Search for a Naval Mine with Application to Distributed Failure Detection ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ An elementary proof that Herman's ring is \(\Theta (N^{2})\)

This page was built for publication: Self-stabilizing token circulation on asynchronous uniform unidirectional rings