Intersection algorithm

The intersection algorithm is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources. It forms part of the modern Network Time Protocol. It is a modified form of Marzullo's algorithm.[1][2]

While Marzullo's algorithm will return the smallest interval consistent with the largest number of sources, the [1]returned interval does not necessarily include the center point (calculated offset) of all the sources in the intersection. The intersection algorithm returns an interval that includes that returned by Marzullo's algorithm but may be larger since it will include the center points. This larger interval allows using additional statistical data to select a point within the interval, reducing the jitter in repeated execution.

  1. ^ a b Mills, D. (2013). "RFC 1305 - Network Time Protocol (Version 3) Specification, Implementation and Analysis". tools.ietf.org. doi:10.17487/RFC1305. Retrieved October 6, 2013. Digital Time Service Functional Specification Version T.1.0.5. Digital Equipment Corporation, 1989.
  2. ^ Digital Time Service Functional Specification Version T.1.0.5. Digital Equipment Corporation, 1989.

Intersection algorithm

Dodaje.pl - Ogłoszenia lokalne