Gradient Clock Synchronization with Practically Constant Local Skew
Christoph Lenzen

TL;DR
This paper introduces a refined model and analysis for Gradient Clock Synchronization, achieving near-optimal local skew bounds under realistic stability assumptions, surpassing previous theoretical limits.
Contribution
It provides a novel analysis that relaxes worst-case assumptions, enabling practical synchronization with improved bounds and self-stabilization in dynamic network conditions.
Findings
Bounded local skew by O(Δ + δ log D) under realistic error stability assumptions.
Circumvents the Ω(Δ log D) lower bound when errors change slowly.
Achieves self-stabilization and extends results to external synchronization scenarios.
Abstract
Gradient Clock Synchronization (GCS) is the task of minimizing the \emph{local skew,} i.e., the clock offset between neighboring clocks, in a larger network. While asymptotically optimal bounds are known, from a practical perspective they have crucial shortcomings: - Local skew bounds are determined by upper bounds on offset estimation that need to be guaranteed throughout the entire lifetime of the system. - Worst-case frequency deviations of local oscillators from their nominal rate are assumed, yet frequencies tend to be much more stable in the (relevant) short term. State-of-the-art deployed synchronization methods adapt to the true offset measurement and frequency errors, but achieve no non-trivial guarantees on the local skew. In this work, we provide a refined model and novel analysis of existing techniques for solving GCS in this model. By requiring only \emph{stability}…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
