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

DOI10.1007/978-3-662-44584-6_24MaRDI QIDQ3190128zbMATH OpenOpenAlexFDO

Authors Yuan Feng, Lijun Zhang

Publication date 15 September 2014

Published in CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• A tighter 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
• Proving the Herman-protocol conjecture

Cited in

(7)

• Coupling and self-stabilization
• Synthesizing optimal bias in randomized self-stabilization
• A tighter bound for the self-stabilization time in Herman's algorithm
• Certification of an exact worst-case self-stabilization time
• A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
• Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
• On the expected time for Herman's probabilistic self-stabilizing algorithm

This page was built for publication: A nearly optimal upper 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 Q3190128)