Fast self-stabilizing Byzantine tolerant digital clock synchronization

Michael Ben-Or*, Danny Dolev, Ezra N. Hoch

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

36 Scopus citations

Abstract

Consider a distributed network in which up to a third of the nodes may be Byzantine, and in which the non-faulty nodes may be subject to transient faults that alter their memory in an arbitrary fashion. Within the context of this model, we are interested in the digital clock synchronization problem; which consists of agreeing on bounded integer counters, and increasing these counters regularly. It has been postulated in the past that synchronization cannot be solved in a Byzantine tolerant and self-stabilizing manner. The first solution to this problem had an expected exponential convergence time. Later, a deterministic solution was published with linear convergence time, which is optimal for deterministic solutions. In the current paper we achieve an expected constant convergence time. We thus obtain the optimal probabilistic solution, both in terms of convergence time and in terms of resilience to Byzantine adversaries.

Original languageAmerican English
Title of host publicationPODC'08
Subtitle of host publicationProceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages385-394
Number of pages10
ISBN (Print)9781595939890
DOIs
StatePublished - 2008
Event27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada
Duration: 18 Aug 200821 Aug 2008

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Country/TerritoryCanada
CityToronto, ON
Period18/08/0821/08/08

Keywords

  • Byzantine failures
  • Clock synchronization
  • Digital clock synchronization
  • Distributed computing
  • Fault tolerance
  • Self-stabilization

Fingerprint

Dive into the research topics of 'Fast self-stabilizing Byzantine tolerant digital clock synchronization'. Together they form a unique fingerprint.

Cite this