Evaluation of Kalman filtering for network time keeping.
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a novel Kalman filtering algorithm for end-to-end time synchronization between a client computer and a server of "true" time [e.g., a Global Positioning System (GPS) source] using messages transmitted over packet-switched networks, such as the internet. The messages exchanged have the network time protocol (NTP) format, and the algorithm evaluated, is performed only at the client side. The Kalman filtering algorithm is compared to two other techniques widely used, based on linear programming and statistical averaging, and the experiments involve independent consecutive measurements (Gaussian case) or measurements exhibiting long-range dependence (self-similar case). Performance is evaluated according to the estimation error of frequency offset and time offset between client and server clock, the standard deviation of the estimates and the number of packets used for a specific estimation. The algorithms could exploit existing NTP infrastructure, and a specific example is presented.
Bletsas
Aggelos
A
MIT Media Laboratory, Cambridge, MA 02139, USA. aggelos@media.mit.edu