PROJECT TITLE :
Skewless Network Clock Synchronization Without Discontinuity: Convergence and Performance
This paper examines synchronization of computer clocks connected via a data network and proposes a skewless algorithm to synchronize them. Unlike existing solutions, that either estimate and compensate the frequency difference (skew) among clocks or introduce offset corrections which will generate jitter and presumably even backward jumps, our answer achieves synchronization without these issues. We have a tendency to first analyze the convergence property of the algorithm and give explicit necessary and sufficient conditions on the parameters to ensure synchronization. We then study the result of noisy measurements (jitter) and frequency drift (wander) on the offsets and synchronization frequency, and further optimize the parameter values to reduce their variance. Our study reveals some insights, for instance, we have a tendency to show that our algorithm can converge even in the presence of timing loops and noise, providing there's a well-outlined leader. This marks a clear distinction with current standards like NTP and PTP, where timing loops are specifically avoided. Furthermore, timing loops can even be beneficial in our scheme as it is demonstrated that highly connected subnetworks will collectively outperform individual clients when the time source has massive jitter. The results are supported by experiments running on a cluster of IBM BladeCenter servers with Linux.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here