Journal of Communication Engineering & Systems
A Precise Clock Synchronization Algorithm in Network
Abstract
To execute a task in a synchronized manner in a distributed setting, we need the common idea of time. To accomplish this intention, clock synchronization is conceptualized. Clock drifting is an intrinsic property of a clock, which necessitates the synchronization. A network consists of nodes, which may execute appropriately or behave badly. The mischievous node may pose difficulty in clock synchronization. We require a method to ease the effect of mischievous nodes. In this study, we present a weighted average clock synchronization algorithm to execute a coordinated activity in a fault-tolerant manner. We use behavior of the node to compute normalized weight in a localized manner, which lies between unit intervals. This weight assignment enables us to contain the effect of misbehavior up to some extent. This algorithm offers better precision while tolerating mischievous nodes. The upper bound of tolerance boundary is one-third of network size.Keywords: Distributed, network, precision, clock, synchronization, tolerant, mischievous, drift, weighted averageCite this Article Phurailatpam Devakinandan Sharma. A Precise Clock Synchronization Algorithm in Network. Journal of Communication Engineering & Systems. 2020; 10(1): 12–21p.References (10)
- Lenzen C, Locher T, Sommer P, Wattenhofer R. Clock Synchronization: Open Problems in Theory and Practice. 36th Conference on Current Trends in Theory and Practice of Computer Science , Špindlerův Mlýn, Czech Republic. Jan 23-29, 2010.
- Lamport L, Shostak R, Pease M. The Byzantine Generals Problem. ACM Trans Program Lang Syst . Jul 1982; 4(3): 382-401p.
- Lamport L, Melliar -Smith PM. Synchronizing Clocks in the Presence of Faults. J ACM. Jan 1985; 32(I): 52-78p.
- Jennifer Lundelius Welch, Nancy Lynch. A New Fault -Tolerant Algorithm for Clock Synchronization. Inf Comput . 1988; 77: 1-36p.
- Pfluegl, Blough DM. A New and Improved Algorithm for Fault -Tolerant Clock Synchronization. J Parallel Distrib Comput. 1995; 27(1): 1-14p.
- Riccardo Gusella, Stefano Zatti. An Election Algorithm for a Distributed Clock Synchronization Program . Report Computer Scien ce Division (EECS), University of California, Berkeley, California, pp. 1-20, 1985. A Precise Clock Synchronization Algorithm in Network Phurailatpam Devakinandan Sharma JoCES (2020) 12-21 © STM Journals 2020. All Rights Reserved Page 21
- Mahaney Stephen R, Schneider Fred B. Inexact Agreement: Accuracy, Precision, and Graceful Degradation. In Proc. of 4th International Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada. Aug 1985; 237-249p.
- Halpern Joseph Y, Barbara Simons, Ray Strong, Danny Dolce. Fault-Tolerant Clock Synchronization. In Proc. of 3rd International Symposium on Principles of Distributed Computing . 1984; 89 -102p. Available from: https://www.cs.huji.ac.il/~ dolev/pubs/p89-halpern.pdf
- Cristian F, Aghili H, Strong R. Clock Synchronization in the Presence of Omission and Performance Faults, and Processor Joins. Proc 16th Int'l Symp Fault-Tolerant Computing Systems , Vienna. Jul 1-4, 1986.
- Srikanth TK, Sam Toueg. Optimal Clock Synchronization. J ACM. Jul 1987; 34(3): 626-645p. Cite this Article Phurailatpam Devakinandan Sharma. A Precise Clock Synchronization Algorithm in Network. Journal of Communication Engineering & System s. 2020; 10(1): 12–21p.