Decentralized algorithms for sequential network time synchronization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Decentralized algorithms for sequential network time synchronization

Résumé

Accurate clock synchronization is important in many distributed applications. Standard algorithms, such as the Network Time Protocol (NTP), essentially rely on pairwise offset estimation between adjacent nodes. Some recent work introduced more elaborate algorithms for clock offset estimation, which take into account the algebraic constraints imposed on the sum of offsets over network cycles, using a least-squares framework. These algorithms are iterative and decentralized in nature, requiring several cycles of local communication among neighbors for convergence. In this paper, we extend this approach towards a sequential estimation framework, which allows to incorporate initial time estimates along with their uncertainty, as well as multiple rounds of pairwise measurements. We propose a decentralized implementation of the estimation algorithm that employs only local broadcasts and establish its convergence to the optimal centralized solution. We also present some simulation results to illustrate the performance benefits of the suggested algorithms.
Fichier principal
Vignette du fichier
regpaper11.pdf (188.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00597320 , version 1 (31-05-2011)

Identifiants

  • HAL Id : inria-00597320 , version 1

Citer

Maxime Cohen, Nahum Shimkin. Decentralized algorithms for sequential network time synchronization. NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Ghent, Belgium. ⟨inria-00597320⟩

Collections

NETCOOP-2010
133 Consultations
98 Téléchargements

Partager

Gmail Facebook X LinkedIn More