Fast self-stabilizing byzantine tolerant digital clock synchronization

DOI10.1145/1400751.1400802zbMath1301.68060OpenAlexW1997521442MaRDI QIDQ2934362

Danny Dolev, Michael Ben-Or, Ezra N. Hoch

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

fault tolerancedistributed computingself-stabilizationclock synchronizationByzantine failuresdigital clock synchronization

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (11)

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks ⋮ Synchronous counting and computational algorithm design ⋮ Efficient Counting with Optimal Resilience ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ Self-stabilizing Byzantine asynchronous unison ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Dynamic FTSS in asynchronous systems: the case of unison ⋮ Randomization adaptive self-stabilization ⋮ Near-optimal self-stabilising counting and firing squads ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

This page was built for publication: Fast self-stabilizing byzantine tolerant digital clock synchronization