๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new method of synchronizing clocks

Publisher
Elsevier Science
Year
1877
Tongue
English
Weight
55 KB
Volume
103
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A precise clock synchronization method u
A precise clock synchronization method using ISDN
โœ Takao Yamashita; Satoshi Ono ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 266 KB

In this paper, a precise clock synchronization method using ISDN is proposed. Time period measurement and time offset measurement are necessary for clock synchronization. Our method measures time periods using a framing clock signal. Time offset measurement is accomplished by directly connecting the

Clock Synchronization on a Multicomputer
Clock Synchronization on a Multicomputer
โœ Bulent Abali; Craig B. Stunkel; Caroline Benveniste ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 474 KB
Some Algorithms for Synchronizing Clocks
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network
โœ Jean-Louis Dornstetter; Daniel Krob; Michel Morvan; Laurent Viennot ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 193 KB

This paper deals with synchronization problems arising in the context of cellular networks. It presents and compares several algorithms that can be used for solving these problems.

Clock synchronization using a linear pro
Clock synchronization using a linear process model
โœ James Aweya; Delfin Y. Montuno; Michel Ouellette; Kent Felske ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 437 KB

## Abstract In this paper, we present a clock synchronization scheme based on a simple linear process model which describes the behaviors of clocks at a transmitter and a receiver. In the clock synchronization scheme, a transmitter sends explicit time indications or timestamps to a receiver, which

A clock synchronization problem with ran
A clock synchronization problem with random delays
โœ G.W Wasilkowski ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 543 KB

In all these papers the message transmission times (called, for short, delays) are assumed to be deterministic, and the performance of algorithms is measured by the worst case with respect to delays. The following negative result is due to Lynch and Lundelius (1985). Even for a completely connected