Intersection algorithm: Difference between revisions

Revision as of 06:31, 7 June 2005

Latest revision as of 18:03, 29 March 2025

(29 intermediate revisions by 25 users not shown)

Line 1:

{{short description|Algorithm for selecting the best sources for time estimation}}

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 '''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]].<ref name=":0">{{cite journal |url= http://tools.ietf.org/html/rfc1305#ref-DEC89 |title=RFC 1305 - Network Time Protocol (Version 3) Specification, Implementation and Analysis |website=tools.ietf.org |year=2013 |doi=10.17487/RFC1305 |quote=Digital Time Service Functional Specification Version T.1.0.5. Digital Equipment Corporation, 1989. |accessdate=October 6, 2013|last1=Mills |first1=D. |doi-access=free }}</ref><ref>Digital Time Service Functional Specification Version T.1.0.5. Digital

Equipment Corporation, 1989.</ref>

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 Intersectionintersection 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==

Given ''M'' intervals of the form ''c''&nbsp;&plusmn;±&nbsp;''r'' (which means [''c''&minus;''r'',''c''+''r'']), the algorithm seeks to find an interval with ''M''&minus;''f'' sources. The value ''f'' is referred to as the number of falsetickers, those sources which are in error (the actual value is outside the [[confidence band]]). The best estimate is that which assumes the least number offewest falsetickers, ''f''. The results will be considered valid if ''f''&nbsp;<&nbsp;''mM''/2, otherwise the algorithm will return failure instead of an interval.

The intersection algorithm begins by creating a table of tuples <offset, type>. For each interval there are three entries: the lower endpoint, the midpoint and the upper endpoint, labelled with types &minus;1, 0 and +1 respectively. Thus the interval ''c''&nbsp;&plusmn;±&nbsp;''r'' results in the entries <''c''&minus;''r'',&minus;1>, <''c'',0> and <''c''+''r'',+1>. These entries are then sorted by offset.

Variables: This algorithm uses ''f'' as number of false tickers, ''endcount'' and ''midcount'' are integers. ''Lower'' and ''upper'' are values of offsets.

<ol start="0">

0)<li> [initialize best f] Start with ''f''=0, assuming all input intervals are valid. Each time no interval is found f will be incremented until either an interval is found or ''f''&nbsp;&ge;≥&nbsp;''mM''/2.</li>

1)<li> [initialize] ''endcount''=0 and ''midcount''=0.</li>

2)<li> [find lower endpoint] Start at beginning of the list (lowest offset) consider each tuple in order. ''endpointendcount''&nbsp;=&nbsp;''endpointendcount''&minus;''type''. If ''endcount''&nbsp;&ge;≥&nbsp;''mM''&minus;''f'' then ''lower''&nbsp;=&nbsp;''offset'' and goto step 3 because the (possible) lower endpoint has been found. If the ''type''&nbsp;=&nbsp;0 then ''midcount''&nbsp;=&nbsp;''midcount''+1. Repeat with next tuple. If reach end of list then goto step 6.</li>

3)<li> [tentative lower endpoint found, initialize to find upper endpoint] set ''endcount''=0. </li>

4)<li> [determine number of midpoints] Start from end of list and work towards lower offsets. ''endcount''&nbsp;=&nbsp;''endcount''+''type''. If ''endcount''&nbsp;&ge;≥&nbsp;''mM''&minus;''f'' then ''upper''&nbsp;=&nbsp;''offset'', goto step 5. If ''type''&nbsp;=&nbsp;0 then ''midcount''&nbsp;=&nbsp;''midcount''+1. Repeat for next tuple. If reach end of list then goto step 6.</li>

5)<li> if ''lower''&nbsp;&le≤&nbsp;''upper'' and ''midcount''&nbsp;&le;≤&nbsp;''f'' then return interval [''lowerendpoint'', ''upperendpoint''] as resulting confidence interval.</li>

6) <li>[increment number of falsetickers] ''f''&nbsp;=&nbsp;''f''+1. If ''f''&nbsp;&ge;≥&nbsp;''mM''/2 then terminate and return FAILED, otherwise goto step 1.</li>

</ol>

==References ==

1) [initialize] ''endcount''=0 and ''midcount''=0.

{{reflist}}

[[Category:Agreement algorithms]]

2) [find lower endpoint] Start at beginning of the list (lowest offset) consider each tuple in order. ''endpoint''&nbsp;=&nbsp;''endpoint''&minus;''type''. If ''endcount''&nbsp;&ge;&nbsp;''m''&minus;''f'' then ''lower''&nbsp;=&nbsp;''offset'' and goto step 3 because the (possible) lower endpoint has been found. If the ''type''&nbsp;=&nbsp;0 then ''midcount''&nbsp;=&nbsp;''midcount''+1. Repeat with next tuple. If reach end of list then goto step 6.

3) [tentative lower endpoint found, initialize to find upper endpoint] set ''endcount''=0.

4) [determine number of midpoints] Start from end of list and work towards lower offsets. ''endcount''&nbsp;=&nbsp;''endcount''+''type''. If ''endcount''&nbsp;&ge;&nbsp;''m''&minus;''f'' then ''upper''&nbsp;=&nbsp;''offset'', goto step 5. If ''type''&nbsp;=&nbsp;0 then ''midcount''&nbsp;=&nbsp;''midcount''+1. Repeat for next tuple. If reach end of list then goto step 6.

5) if ''lower''&nbsp;&le&nbsp;''upper'' and ''midcount''&nbsp;&le;&nbsp;''f'' then return interval [''lowerendpoint'',''upperendpoint''] as resulting confidence interval.

6) [increment number of falsetickers] ''f''&nbsp;=&nbsp;''f''+1. If ''f''&nbsp;&ge;&nbsp;''m''/2 then terminate and return FAILED, otherwise goto step 1.

[[Category:Algorithms]]