Clock Synchronization in Distributed Systems: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 27: Line 27:


[[File:Clock Synchronization in Distributed Systems - Time.png|1000px]]
[[File:Clock Synchronization in Distributed Systems - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Clock Synchronization in Distributed Systems - Space.png|1000px]]
== Time-Space Tradeoff ==
[[File:Clock Synchronization in Distributed Systems - Pareto Frontier.png|1000px]]

Latest revision as of 09:11, 28 April 2023

Description

The difference between the largest and the smallest clock values among all stations in a Mobile Ad Hoc Network (MANET) is called the maximum clock offset. The goal is to minimize the maximum clock offset.

Parameters

$n$: number of nodes in network

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
ASP 2005 $O(n)$ $O(n)$ (per node) Exact Deterministic Time
Clock-sampling mutual network synchronization 2007 $O(n)$ $O({1})$? (per node) Exact Deterministic Time
MATSF 2004 $O(n)$ $O(n)$? (per node) Exact Deterministic Time

Time Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination