Clock Synchronization in the Byzantine-Recovery Failure Model

Abstract : We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may alternate correct and Byzantine behaviors. We propose a clock synchronization algorithm based on periodical resynchronizations which is based on the assumption that no more than f < n/3 processes (with n the number of processors in the system) are simultaneously faulty. Both, accuracy (clocks being within a linear envelope of real-time) and precision (maximum deviation between clocks) perpetually hold for processes which sufficiently long follow their algorithm. We provide expressions for both the recovery time and the failure turn-over rates. Both expressions are independent of f, and are less than the time needed to execute 3 resynchronizations.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00264219
Contributor : Emmanuelle Anceaume <>
Submitted on : Friday, March 14, 2008 - 3:31:06 PM
Last modification on : Thursday, February 7, 2019 - 4:01:15 PM
Long-term archiving on : Friday, September 28, 2012 - 11:15:24 AM

File

opodis07-camera-ready.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00264219, version 1

Citation

Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder. Clock Synchronization in the Byzantine-Recovery Failure Model. OPODIS, 2007, Pointe-à-Pitre, France. ⟨inria-00264219⟩

Share

Metrics

Record views

839

Files downloads

205