Self-stabilizing clock synchronization in the presence of Byzantine faults

DOI10.1145/1017460.1017463zbMath1204.68094OpenAlexW1970745521WikidataQ56806106 ScholiaQ56806106MaRDI QIDQ3069909

Shlomi Dolev, Jennifer Lundelius Welch

Publication date: 1 February 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1017460.1017463

zbMATH Keywords

bounded clock synchronizationByzantine processor failuresrandomized self-stabilizing protocols

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20) Theory of operating systems (68N25)

Related Items

Fast computation by population protocols with a leader, A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip, The triumph and tribulation of system stabilization, Synchronous counting and computational algorithm design, Efficient Counting with Optimal Resilience, Self-stabilizing indulgent zero-degrading binary consensus, Parallel composition for time-to-fault adaptive stabilization, Booting clock synchronization in partially synchronous systems with hybrid process and link failures, Self-stabilizing Byzantine asynchronous unison, Robust and scalable middleware for selfish-computer systems, Perennial secure multi-party computation of universal Turing machine, Maximum metric spanning tree made Byzantine tolerant, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Dynamic FTSS in asynchronous systems: the case of unison, Game authority for robust and scalable distributed selfish-computer systems, Randomization adaptive self-stabilization, Secret Swarm Unit Reactive k −Secret Sharing, Near-optimal self-stabilising counting and firing squads, Self-stabilizing Byzantine clock synchronization with optimal precision, Dynamic ad hoc clock synchronization, Fault-tolerant algorithms for tick-generation in asynchronous logic