A Review on Message Complexity of the Algorithms for Clock Synchronization in Distributed Systems

TL;DR

This paper provides a comprehensive review of clock synchronization algorithms in distributed systems, focusing on message complexity analysis and comparing the efficiency of four prominent algorithms.

Contribution

It offers an extensive analysis of message complexity in clock synchronization algorithms, including detailed comparisons of four key algorithms in distributed systems.

Findings

Lamport's Algorithm has moderate message complexity.

Ricart-Agrawala Algorithm's message complexity varies with network size.

Vector Clocks Algorithm offers high accuracy with increased message overhead.

Abstract

In this work, we present an extensive analysis of clock synchronization algorithms, with a specific focus on message complexity. We begin by introducing fundamental concepts in clock synchronization, such as the Byzantine generals problem and specific concepts like clock accuracy, precision, skew, offset, timestamping, and clock drift estimation. Describing the concept of logical clocks, their implementation in distributed systems is discussed, highlighting their significance and various approaches. The paper then examines four prominent clock synchronization algorithms: Lamport's Algorithm, Ricart-Agrawala Algorithm, Vector Clocks Algorithm, and Christian's Algorithm. Special attention is given to the analysis of message complexity, providing insights into the efficiency of each algorithm. Finally, we compare the message complexities of the discussed algorithms.