Self-stabilizing Byzantine asynchronous unison
From MaRDI portal
Publication:455967
DOI10.1016/J.JPDC.2012.04.001zbMath1248.68090arXiv0912.0134OpenAlexW1992961293MaRDI QIDQ455967
Sébastien Tixeuil, Swan Dubois, Mikhail V. Nesterenko, Maria Gradinariu Potop-Butucaru
Publication date: 23 October 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.0134
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast ⋮ Efficient Counting with Optimal Resilience ⋮ Self-stabilizing Byzantine asynchronous unison
Cites Work
- Unnamed Item
- Self-stabilizing Byzantine asynchronous unison
- Maximum metric spanning tree made Byzantine tolerant
- Dynamic FTSS in asynchronous systems: the case of unison
- Stabilizing unison
- Fast self-stabilizing byzantine tolerant digital clock synchronization
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- The Impact of Topology on Byzantine Containment in Stabilization
- Complexity of network synchronization
- The Byzantine Generals Problem
- Self-stabilizing systems in spite of distributed control
- Self-stabilizing byzantine agreement
- Time optimal self-stabilizing synchronization
- Self-stabilization of Byzantine Protocols
- When graph theory helps self-stabilization
- Principles of Distributed Systems
This page was built for publication: Self-stabilizing Byzantine asynchronous unison
