Efficient Two-Dimensional Self-Stabilizing Byzantine Clock Synchronization in WALDEN

TL;DR

This paper presents a novel self-stabilizing Byzantine clock synchronization method for two-dimensional networks, achieving efficient, rapid stabilization with high probability under specific fault conditions.

Contribution

It introduces a new approach combining approximate agreement, hopping, and randomized grandmasters within a two-dimensional framework for Byzantine fault tolerance.

Findings

Achieves synchronization with less than 1/3 Byzantine terminal components.

Stabilization occurs within one or several seconds with high probability.

Effective in networks partitioned into three arbitrarily connected subnetworks.

Abstract

For tolerating Byzantine faults of both the terminal and communication components in self-stabilizing clock synchronization, the two-dimensional self-stabilizing Byzantine-fault-tolerant clock synchronization problem is investigated and solved. By utilizing the time-triggered (TT) stage provided in the underlying networks as TT communication windows, the approximate agreement, hopping procedure, and randomized grandmasters are integrated into the overall solution. It is shown that with partitioning the communication components into $3$ arbitrarily connected subnetworks, efficient synchronization can be achieved with one such subnetwork and less than $1/3$ terminal components being Byzantine. Meanwhile, the desired stabilization can be reached for the specific networks in one or several seconds with high probabilities. This helps in developing various distributed hard-real-time systems with stringent time, resources, and safety requirements.