Fast self-stabilizing byzantine tolerant digital clock synchronization

  • Authors:

  • Michael Ben-Or;Danny Dolev;Ezra N. Hoch

  • Affiliations:

  • Hebrew University, Jerusalem, Israel;Hebrew University, Jerusalem, Israel;Hebrew University, Jerusalem, Israel

  • Venue:
  • Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.