A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
From MaRDI portal
Publication:498668
DOI10.1007/S00446-015-0241-ZzbMATH Open1337.68037OpenAlexW2015069864MaRDI QIDQ498668FDOQ498668
Authors: Yuan Feng, Lijun 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
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Interacting particle systems. With a new postface.
- Diffusion-reaction in one dimension
- Probabilistic self-stabilization
- An elementary proof that Herman's ring is \(\Theta (N^{2})\)
- Three tokens in Herman's algorithm
- Coupling and self-stabilization
- On stabilization in Herman's algorithm
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Probabilistic verification of Herman's self-stabilisation algorithm
- A tighter bound for the self-stabilization time in Herman's algorithm
- A nearly optimal upper bound for the self-stabilization time in Herman's algorithm
Cited In (7)
- Probabilistic verification of Herman's self-stabilisation algorithm
- On the expected time for Herman's probabilistic self-stabilizing algorithm
- Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
- A tighter bound for the self-stabilization time in Herman's algorithm
- Synthesizing optimal bias in randomized self-stabilization
- Computing and Combinatorics
- A nearly optimal upper bound for the self-stabilization time in Herman's 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 Q498668)
