Cristian's algorithm

Cristian's algorithm (introduced by

(RTT) of the request is short compared to required accuracy. It also suffers in implementations using a single server, making it unsuitable for many distributive applications where redundancy may be crucial.

Description

Cristian's algorithm works between a process P, and a time server S connected to a time reference source. Put simply:

1. P requests the time from S at time t₀.
2. After receiving the request from P, S prepares a response and appends the time T from its own clock.
3. P receives the response at time t₁ then sets its time to be T + RTT/2, where RTT=t₁-t₀.

If the RTT is actually split equally between request and response, the synchronisation is error-free. But due to unpredictable influences, this assumption is regularly not true. Longer RTTs indicate interference that is generally asymmetrical. Offset and jitter of the synchronisation are thus minimised by selecting suitable RTT from a set of many request/response pairs. Whether an RTT can be accepted at a given time depends on the drift of the clock and on the statistics of the RTT. These quantities can be measured in the course of synchronisation, which optimises the method by itself.

See also

• Allan variance
• Berkeley algorithm
• Clock synchronization
• Daytime Protocol, older time synchronization protocol using TCP or UDP port 13
• ICMP Timestamp Reply
  , older time synchronization protocol using ICMP
• International Atomic Time
• NTP pool, a collection of worldwide computers that provide a highly accurate time via the Network Time Protocol
• NTP server misuse and abuse
• ntpd, OpenNTPD and Ntpdate
• Precision Time Protocol
• Synchronization
• Time Protocol, older time synchronization protocol using TCP or UDP port 37
• Time server

References