Clock synchronization and the power of broadcasting

DOI10.1007/BF02259749zbMath0738.68003OpenAlexW2050175741MaRDI QIDQ1176072

Joseph Y. Halpern, Ichiro Suzuki

Publication date: 25 June 1992

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02259749

zbMATH Keywords

multicastingbroadcastingclock synchronizationmultiple access networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Time synchronization methods for wireless sensor networks: A survey ⋮ ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS

Cites Work

• On the possibility and impossibility of achieving clock synchronization
• Easy impossibility proofs for distributed consensus problems
• Optimal precision in the presence of uncertainty
• A new fault-tolerant algorithm for clock synchronization
• Reliable broadcasts and communication models: tradeoffs and lower bounds
• An upper and lower bound for clock synchronization
• Synchronizing clocks in the presence of faults
• Time, clocks, and the ordering of events in a distributed system
• Dynamic fault-tolerant clock synchronization

This page was built for publication: Clock synchronization and the power of broadcasting