Time synchronization over networks using convex closures

This paper presents a general time synchronization algorithm that analyzes the time offset between any two computers clocks in a network and its evolution, by using mathematical topology properties. It builds a conversion function that produces precise and guaranteed bounds for each time conversion,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking 2000-04, Vol.8 (2), p.265-277
1. Verfasser: Berthaud, J.-M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a general time synchronization algorithm that analyzes the time offset between any two computers clocks in a network and its evolution, by using mathematical topology properties. It builds a conversion function that produces precise and guaranteed bounds for each time conversion, and which provides accurate time synchronization. It is able to automatically adjust the observation process so as to maintain the error bound within some specified limit. It does not require adjustments to local clocks, and it features a way of filtering observation data based on a criterion of usefulness to improve precision, thus discarding only useless information. Advantages over approaches using other tools to filter out and analyze observation data (mean and variance, linear regression, midpoint functions, etc.) are exposed. Special attention is given to assessing the uncertainties and errors made in the observation process, and to their propagation in the estimation processes. The developed technique allows one to globally achieve a better precision than what has been reached on each single observation, given some conditions of operation that are explained.
ISSN:1063-6692
1558-2566
DOI:10.1109/90.842147