NETWORK TIME PROTOCOL

The Network Time Protocol (NTP) is a standard for synchronising the clocks of computer systems over packet-switched data networks. Although NTP is most commonly used as part of the UDP/IP protocol suite, it can also be transported over other network protocols such as TCP/IP. It is designed particularly to resist the effects of variable latency.

NTP uses the Marzullo algorithm (invented by Keith Marzullo of UC-San Diego in his dissertation) with the UTC time scale, including support for features such as leap seconds. NTPv4 can usually maintain time to within 10 milliseconds over the public Internet, and can achieve accuracies of 200 microseconds or better in local area networks under ideal conditions.

It makes use of the to synchronize the clocks of two computers on a variable latency network.

NTP is one of the oldest TCP/IP protocols still in use. NTP was originally designed by Dave Mills of the University of Delaware, who still maintains it. The current version is NTP version 4.

The NTP daemon is a user-level process that runs continuously on a machine that supports NTP, and most of the protocol is implemented in this user process. To get the best performance from NTP, it is important to have the standard NTP clock phase-locked loop implemented in the operating system kernel, rather than using only the intervention of the external NTP daemon: all recent versions of the Linux operating system have this support.

NTP uses a hierarchical system of "clock strata", where stratum 1 systems are synchronised to an accurate external clock such as a GPS clock or other radio clock. NTP stratum 2 systems derive their time from one or more stratum 1 systems, and so on. (Note that this is different from the notion of clock stratum used in telecommunications systems).

The 64-bit timestamps used by NTP consist of a 32-bit seconds part and a 32-bit fractional second part, giving NTP a time scale of 2³² seconds, with a theoretical resolution of 2^-32 seconds. Although the NTP timescale wraps round every 2³² seconds, implementations should disambiguate NTP time using a knowledge of the approximate time from other sources. Since this only requires time accurate to a few decades, this is not a problem in general use.

The operational details of NTP are illustrated in RFCs 778, 891, 956, 958, 1305, and 2030.

See also:

• Allan variance
• Synchronization

External links

• Abouttime NTP client for Windows
• http://www.ntp.org/
• http://www.eecis.udel.edu/~mills/
• http://chrony.sunsite.dk/