Cristian's Algorithm is a clock synchronization algorithm is used to synchronize time with a time server by client processes. This algorithm works well with low-latency networks where Round Trip Time is short as compared to accuracy while redundancy-prone distributed systems/applications do not go hand in hand with this algorithm. Here Round Trip Time refers to the time duration between the start of a Request and the end of the corresponding Response.
Below is an illustration imitating the working of Cristian's algorithm:
Algorithm:
1) The process on the client machine sends the request for fetching clock time(time at the server) to the Clock Server at time T_0 .
2) The Clock Server listens to the request made by the client process and returns the response in form of clock server time.
3) The client process fetches the response from the Clock Server at time T_1 and calculates the synchronized client clock time using the formula given below.
\[ T_{CLIENT} = T_{SERVER} + (T_1 - T_0)/2 \]
where T_{CLIENT} refers to the synchronized clock time,
T_{SERVER} refers to the clock time returned by the server,
T_0 refers to the time at which request was sent by the client process,
T_1 refers to the time at which response was received by the client process
Working/Reliability of the above formula:
T_1 - T_0 refers to the combined time taken by the network and the server to transfer the request to the server, process the request, and return the response back to the client process, assuming that the network latency T_0 and T_1 are approximately equal.
The time at the client-side differs from actual time by at most (T_1 - T_0)/2 seconds. Using the above statement we can draw a conclusion that the error in synchronization can be at most (T_1 - T_0)/2 seconds.
Hence,
\[ error\, \epsilon\, [-(T_1 - T_0)/2, \, (T_1 - T_0)/2] \]
Python Codes below illustrate the working of Cristian's algorithm:
Code below is used to initiate a prototype of a clock server on local machine:
C++
// C++ equivalent
#include <iostream>
#include <string>
#include <chrono>
#include <ctime>
#include <sys/socket.h>
// Function used to initiate the Clock Server
void initiateClockServer() {
// Create socket
int socketfd = socket(AF_INET, SOCK_STREAM, 0);
std::cout << "Socket successfully created" << std::endl;
// Set port
int port = 8000;
// Bind socket to port
struct sockaddr_in server_addr;
server_addr.sin_family = AF_INET;
server_addr.sin_addr.s_addr = INADDR_ANY;
server_addr.sin_port = htons(port);
bind(socketfd, (struct sockaddr*)&server_addr, sizeof(server_addr));
std::cout << "Socket is listening..." << std::endl;
// Start listening to requests
listen(socketfd, 5);
// Clock Server Running forever
while (true) {
// Establish connection with client
struct sockaddr_in client_addr;
int client_len = sizeof(client_addr);
int connfd = accept(socketfd, (struct sockaddr*) &client_addr, (socklen_t*)&client_len);
std::cout << "Server connected to " << client_addr.sin_addr.s_addr << std::endl;
// Respond the client with server clock time
std::chrono::time_point<std::chrono::system_clock> now = std::chrono::system_clock::now();
std::time_t time = std::chrono::system_clock::to_time_t(now);
std::string time_str = std::ctime(&time);
send(connfd, time_str.c_str(), time_str.size(), 0);
// Close the connection with the client process
close(connfd);
}
}
// Driver function
int main() {
// Trigger the Clock Server
initiateClockServer();
return 0;
}
import java.net.*;
import java.io.*;
import java.util.Date;
public class ClockServer {
// Function used to initiate the Clock Server
public static void initiateClockServer() throws IOException
{
// Create socket
ServerSocket serverSocket = new ServerSocket(8000);
System.out.println("Socket successfully created");
// Clock Server Running forever
while (true)
{
// Start listening to requests
System.out.println("Socket is listening...");
Socket clientSocket = serverSocket.accept();
System.out.println("Server connected to " + clientSocket.getInetAddress());
// Respond the client with server clock time
Date now = new Date();
String timeStr = now.toString();
OutputStream os = clientSocket.getOutputStream();
OutputStreamWriter osw = new OutputStreamWriter(os);
BufferedWriter bw = new BufferedWriter(osw);
bw.write(timeStr + "\n");
bw.flush();
// Close the connection with the client process
clientSocket.close();
}
}
// Driver function
public static void main(String[] args) throws IOException
{
// Trigger the Clock Server
initiateClockServer();
}
}
# Python3 program imitating a clock server
import socket
import datetime
# function used to initiate the Clock Server
def initiateClockServer():
s = socket.socket()
print("Socket successfully created")
# Server port
port = 8000
s.bind(('', port))
# Start listening to requests
s.listen(5)
print("Socket is listening...")
# Clock Server Running forever
while True:
# Establish connection with client
connection, address = s.accept()
print('Server connected to', address)
# Respond the client with server clock time
connection.send(str(
datetime.datetime.now()).encode())
# Close the connection with the client process
connection.close()
# Driver function
if __name__ == '__main__':
# Trigger the Clock Server
initiateClockServer()
using System;
using System.Net;
using System.Net.Sockets;
using System.Text;
using System.Threading;
class Program
{
static void Main(string[] args)
{
// Trigger the Clock Server
initiateClockServer();
}
static void initiateClockServer()
{
// Create socket
Socket socketfd = new Socket(AddressFamily.InterNetwork, SocketType.Stream, ProtocolType.Tcp);
Console.WriteLine("Socket successfully created");
// Set port
int port = 8000;
// Bind socket to port
IPEndPoint serverAddr = new IPEndPoint(IPAddress.Any, port);
socketfd.Bind(serverAddr);
Console.WriteLine("Socket is listening...");
// Start listening to requests
socketfd.Listen(5);
// Clock Server Running forever
while (true)
{
// Establish connection with client
Socket clientSock = socketfd.Accept();
Console.WriteLine("Server connected to " + clientSock.RemoteEndPoint.ToString());
// Respond the client with server clock time
DateTime now = DateTime.Now;
string time_str = now.ToString();
byte[] time_bytes = Encoding.ASCII.GetBytes(time_str);
clientSock.Send(time_bytes);
// Close the connection with the client process
clientSock.Shutdown(SocketShutdown.Both);
clientSock.Close();
}
}
}
const net = require('net');
const port = 8000;
// function used to initiate the Clock Server
function initiateClockServer() {
const server = net.createServer(function(connection) {
console.log('Server connected to', connection.remoteAddress);
// Respond the client with server clock time
connection.write(new Date().toString());
// Close the connection with the client process
connection.end();
});
server.listen(port, function() {
console.log("Socket is listening...");
});
}
// Driver function
if (require.main === module) {
// Trigger the Clock Server
initiateClockServer();
}
// This code is contributed by rishab
Output:
Socket successfully created
Socket is listening...
Code below is used to initiate a prototype of a client process on the local machine:
Python3
# Python3 program imitating a client process
import socket
import datetime
from dateutil import parser
from timeit import default_timer as timer
# function used to Synchronize client process time
def synchronizeTime():
s = socket.socket()
# Server port
port = 8000
# connect to the clock server on local computer
s.connect(('127.0.0.1', port))
request_time = timer()
# receive data from the server
server_time = parser.parse(s.recv(1024).decode())
response_time = timer()
actual_time = datetime.datetime.now()
print("Time returned by server: " + str(server_time))
process_delay_latency = response_time - request_time
print("Process Delay latency: " \
+ str(process_delay_latency) \
+ " seconds")
print("Actual clock time at client side: " \
+ str(actual_time))
# synchronize process client clock time
client_time = server_time \
+ datetime.timedelta(seconds = \
(process_delay_latency) / 2)
print("Synchronized process client time: " \
+ str(client_time))
# calculate synchronization error
error = actual_time - client_time
print("Synchronization error : "
+ str(error.total_seconds()) + " seconds")
s.close()
# Driver function
if __name__ == '__main__':
# synchronize time using clock server
synchronizeTime()
Output:
Time returned by server: 2018-11-07 17:56:43.302379
Process Delay latency: 0.0005150819997652434 seconds
Actual clock time at client side: 2018-11-07 17:56:43.302756
Synchronized process client time: 2018-11-07 17:56:43.302637
Synchronization error : 0.000119 seconds
Improvision in Clock Synchronization:
Using iterative testing over the network, we can define a minimum transfer time using which we can formulate an improved synchronization clock time(less synchronization error).
Here, by defining a minimum transfer time, with a high confidence, we can say that the server time will
always be generated after T_0 + T_{min} and the T_{SERVER} will always be generated before T_1 - T_{min} , where T_{min} is the minimum transfer time which is the minimum value of T_{REQUEST} and T_{RESPONSE} during several iterative tests. Here synchronization error can be formulated as follows:
\[ error\, \epsilon\, [-((T_1 - T_0)/2 - T_{min}), \, ((T_1 - T_0)/2 - T_{min})] \]
Similarly, if T_{REQUEST} and T_{RESPONSE} differ by a considerable amount of time, we may substitute T_{min} by T_{min1} and T_{min2} , where T_{min1} is the minimum observed request time and T_{min2} refers to the minimum observed response time over the network.
The synchronized clock time in this case can be calculated as:
\[ T_{CLIENT} = T_{SERVER} + (T_1 - T_0)/2 + (T_{min2} - T_{min1})/2 \]
So, by just introducing response and request time as separate time latencies, we can improve the synchronization of clock time and hence decrease the overall synchronization error. A number of iterative tests to be run depends on the overall clock drift observed.
Advantages:
Simple and easy to implement: Cristian's Algorithm is a relatively simple algorithm and can be implemented easily on most computer systems.
Fast synchronization: The algorithm can synchronize the system clock with the time server quickly and efficiently.
Low network traffic: The algorithm requires only one round trip between the client and the server, which reduces network traffic and improves performance.
Works well for small networks: Cristian's Algorithm works well for small networks where the network latency is relatively low.
Disadvantages:
Requires a trusted time server: Cristian's Algorithm requires a trusted time server that provides accurate time information. If the time server is compromised or provides incorrect time information, it can lead to incorrect time synchronization.
Limited scalability: The algorithm is not suitable for large networks where the network latency can be high, as it may not be able to provide accurate time synchronization.
Not resilient to network failures: The algorithm does not handle network failures well, which can result in inaccurate time synchronization.
Vulnerable to malicious attacks: The algorithm is vulnerable to malicious attacks, such as man-in-the-middle attacks, which can lead to incorrect time synchronization.
References:
1) https://en.wikipedia.org/wiki/Cristian%27s_algorithm
2) https://en.wikipedia.org/wiki/Round-trip_delay_time
3) https://www.geeksforgeeks.org/python/socket-programming-python/
4) https://en.wikipedia.org/wiki/Clock_drift
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem