Clock Distribution with Gradient TRIX
Gradient clock synchronization (GCS) algorithms minimize the worst-case clock offset between the nodes in a distributed network of diameter D and size n. They achieve optimal offsets of Θ(log D) locally, i.e., between adjacent nodes [14] and Θ(D) globally [2]. A key open problem in this area is to achieve fault tolerance at minimal edge replication overhead.
Authors
- Christoph Lenzen (ORCID: https://orcid.org/0000-0002-3290-0674)
- Shreyas Srinivas (ORCID: https://orcid.org/0000-0002-3993-1596)
Institutions
- Helmholtz Center for Information Security (DE)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733524
- Primary Topic
- Network Time Synchronization Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- European Commission
- European Research Council