Intersection algorithm: Difference between revisions

Revision as of 00:46, 22 January 2005

Revision as of 14:00, 29 January 2005

Line 1:

The '''Intersection Algorithm''' is an [[agreement algorithm]] used to select sources for estimating accurate time from a number of [[noise|noisy]] time sources, it forms part of the modern Network Time Protocol. It is a modified form of [[Marzullo's algorithm]].

While Marzullo's Algorithm will return the smallest interval consistantconsistent with the largest number of sources, the 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.