Self-stabilizing Byzantine asynchronous unison

DOI10.1016/J.JPDC.2012.04.001MaRDI QIDQ455967zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

• Complexity of network synchronization
• Dynamic FTSS in asynchronous systems: the case of unison
• Fast self-stabilizing Byzantine tolerant digital clock synchronization
• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Principles of Distributed Systems
• Self-stabilization
• Self-stabilization of Byzantine Protocols
• Self-stabilizing Byzantine agreement
• Self-stabilizing Byzantine asynchronous unison
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Self-stabilizing systems in spite of distributed control
• Stabilizing unison
• The Byzantine Generals Problem
• The impact of topology on Byzantine containment in stabilization
• Time optimal self-stabilizing synchronization
• When graph theory helps self-stabilization

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)