Self-stabilizing Byzantine asynchronous unison

DOI10.1016/J.JPDC.2012.04.001zbMATH Open1248.68090arXiv0912.0134OpenAlexW1992961293MaRDI QIDQ455967FDOQ455967

Authors: Swan Dubois, Sébastien Tixeuil, Maria Potop-Butucaru, Mikhail Nesterenko 

Publication date: 23 October 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Abstract: We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm has minimum possible containment radius and optimal stabilization time.

Full work available at URL: https://arxiv.org/abs/0912.0134

Recommendations

• Synchronous vs. Asynchronous Unison
• Synchronous vs. asynchronous unison
• Dynamic FTSS in asynchronous systems: the case of unison
• Self-stabilizing Byzantine agreement
• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

zbMATH Keywords

self-stabilizationclock synchronizationByzantine containmentstrict stabilizationunison

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cites Work

• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Time optimal self-stabilizing synchronization
• Complexity of network synchronization
• The Byzantine Generals Problem
• 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
• Self-stabilizing Byzantine asynchronous unison
• Self-stabilizing Byzantine agreement
• Self-stabilization of Byzantine Protocols
• When graph theory helps self-stabilization
• Dynamic FTSS in asynchronous systems: the case of unison
• Principles of Distributed Systems

Cited In (10)

• Wait-free regular storage from Byzantine components
• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Synchronous vs. Asynchronous Unison
• Practically-self-stabilizing virtual synchrony
• Efficient counting with optimal resilience
• Self-stabilizing Byzantine asynchronous unison
• Dynamic FTSS in asynchronous systems: the case of unison
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Synchronous vs. asynchronous unison

This page was built for publication: Self-stabilizing Byzantine asynchronous unison

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