A tighter bound for the self-stabilization time in Herman's algorithm

DOI10.1016/J.IPL.2013.04.006MaRDI QIDQ2444741zbMATH OpenOpenAlexFDO

Authors Yuan Feng, Lijun Zhang

Publication date 11 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.04.006

zbMATH Keywords

formal methodsHerman's algorithmMarkov chainsself-stabilization algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• Bounds on Herman's algorithm
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• On stabilization in Herman's algorithm

Cites work

• An elementary proof that Herman's ring is \(\Theta (N^{2})\)
• Coupling and self-stabilization
• On stabilization in Herman's algorithm
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• Probabilistic self-stabilization
• Probabilistic verification of Herman's self-stabilisation algorithm
• Three tokens in Herman's algorithm

Cited in

(3)

• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• On the expected time for Herman's probabilistic self-stabilizing algorithm

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

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