Intersection algorithm: Difference between revisions

Revision as of 23:50, 6 October 2013

Revision as of 00:03, 7 October 2013

Line 1:

{{Unreferenced|date=July 2007}}

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]].

The '''Intersectionintersection Algorithmalgorithm''' 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 Algorithmalgorithm will return the smallest interval consistent 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 Algorithmalgorithm 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.

==Method==

Line 25 ⟶ 27:

6) [increment number of falsetickers] ''f'' = ''f''+1. If ''f'' ≥ ''M''/2 then terminate and return FAILED, otherwise goto step 1.

{{Unreferenced|date=July 2007}}

[[Category:Agreement algorithms]]