Year: 2025
Type: conference-paper
Abstract: 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: Shreyas Srinivas, Christoph Lenzen
Institution: Helmholtz Center for Information Security
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: G4244000698, G434337789
OpenAlex ID: W4411277483