Clock synchronization with faults and recoveries (extended abstract)

DOI10.1145/343477.343534zbMath1314.68367OpenAlexW1994302879MaRDI QIDQ5176779

Amir Herzberg, Boaz Barak, Shai Halevi, Dalit Naor

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

clock synchronizationmobile adversaryproactive systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks ⋮ Combination of clock-state and clock-rate correction in fault-tolerant distributed systems ⋮ Consensus when all processes may be Byzantine for some time

This page was built for publication: Clock synchronization with faults and recoveries (extended abstract)