Scribd
Upload
99 views

Christian Algorithm

1. Christian's algorithm uses a time server connected to a source of UTC to synchronize computer clocks externally. 2. Upon a request, the server returns the time according to its clock. The requesting process records the round-trip time and estimates its clock by taking the returned time plus half the round-trip time. 3. If messages are sent over different networks, the minimum transmission time can be used to determine a range for the estimated time with the earliest point being the returned time plus the minimum transmission time and latest being the returned time plus the round-trip time minus the minimum transmission time.

Uploaded by

Yoga
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
99 views

Christian Algorithm

1. Christian's algorithm uses a time server connected to a source of UTC to synchronize computer clocks externally. 2. Upon a request, the server returns the time according to its clock. The requesting process records the round-trip time and estimates its clock by taking the returned time plus half the round-trip time. 3. If messages are sent over different networks, the minimum transmission time can be used to determine a range for the estimated time with the earliest point being the returned time plus the minimum transmission time and latest being the returned time plus the round-trip time minus the minimum transmission time.

Uploaded by

Yoga
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Christians Algorithm Uses a timeserver connected to a device that receives signals from a source of UTC to synchronise computers externally.

Upon request, the server S supplies the time according to its clock. Assumption: 1. No upper bound on delays 2. Round-trip times for message exchange are reasonably short (a small fraction of a second). A probabilistic algorithm: The method achieves synchronization only if the observed round-trip times are sufficiently short. The process Process p requests the time in a message mR, and receives the time value T in message mT (T is inserted in mT at the last possible point before transmission). process p records the total round-trip time Tround taken to send the request mR and receives the reply mT. A simple estimate of time for p to set its clock is: T + Tround /2 assuming the elapsed time is split equally before and after S placed T in mT.
4.

1.

2.

3.

If the two messages are transmitted over two different networks then the value of MINIMUM transmission (MIN) may be estimated and the accuracy of results can be determined as follows:

With Minimum Error: Earliest point at which S could have placed time T in mT = MIN after P dispatched mR T = mT + MIN With Maximum Error: Latest point at which S could have placed T in mT = MIN before mT arrived at p: Maximumm error is tRound MIN T = mT + (tRound MIN) Time Rage: The time (T) by Ss clock when the reply message arrives is therefore in the range of: [T + MIN, T + tRound MIN)] The width of this range is: tRound 2 MIN So the accuracy is: |( tRound / 2 - MIN)|

You might also like