Gradient clock synchronization

DOI10.1007/S00446-005-0135-6MaRDI QIDQ2375294zbMATH OpenOpenAlexFDO

Authors Rui Fan, Nancy Lynch

Publication date 13 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-005-0135-6

zbMATH Keywords

lower boundsclock synchronizationindistinguishabilityad-hoc networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Gradient clock synchronization
• Oblivious Gradient Clock Synchronization
• Gradient clock synchronization in dynamic networks
• Tight bounds for clock synchronization
• Tight bounds for clock synchronization

Cites work

• A new fault-tolerant algorithm for clock synchronization
• A theory of clock synchronization (extended abstract)
• An upper and lower bound for clock synchronization
• Closed form bounds for clock synchronization under simple uncertainty assumptions
• Optimal and efficient clock synchronization under drifting clocks
• Optimal precision in the presence of uncertainty
• Synchronizing clocks in the presence of faults
• The theory of timed I/O automata

Cited in

(9)

• Clock synchronization and estimation in highly dynamic networks: an information theoretic approach
• Improved time bounds for linearizable implementations of abstract data types
• scientific article; zbMATH DE number 2193899 (Why is no real title available?)
• Gradient clock synchronization
• Distributed time synchronization for networks with random delays and measurement noise
• Analysis of a clock synchronization protocol for wireless sensor networks
• Oblivious Gradient Clock Synchronization
• Tight bounds for clock synchronization
• Gradient clock synchronization in dynamic networks

This page was built for publication: Gradient clock synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375294)