A nearly optimal upper bound for the self-stabilization time in Herman's algorithm

DOI10.1007/S00446-015-0241-ZzbMath1337.68037OpenAlexW2015069864MaRDI QIDQ498668

Yuan Feng, Li-jun Zhang

Publication date: 29 September 2015

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

Full work available at URL: http://hdl.handle.net/10453/41865

zbMATH Keywords

self-stabilizationLagrange multipliers methodHerman's algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Interacting particle systems. With a new postface.
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• Probabilistic self-stabilization
• An elementary proof that Herman's ring is \(\Theta (N^{2})\)
• Probabilistic verification of Herman's self-stabilisation algorithm
• Three tokens in Herman's algorithm
• Coupling and self-stabilization
• A tighter bound for the self-stabilization time in Herman's algorithm
• On Stabilization in Herman’s Algorithm
• A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm
• Diffusion-reaction in one dimension
• Self-stabilizing systems in spite of distributed control

This page was built for publication: A nearly optimal upper bound for the self-stabilization time in Herman's algorithm