Clock synchronization algorithm for address independent networks

DETAILED DESCRIPTION It is therefore an object of the invention to provide a simple clock synchronization algorithm for synchronization of clocks in a distributed network.
It is a further object of the invention to provide a clock synchronization algorithm for broadcast networks that takes advantage of the characteristics of such networks.
It is another object of the invention to provide a simple yet accurate clock synchronization algorithm which may be implemented in software of hardware.
The objects of the invention are accomplished by using the fastest clock in the network as the master clock against which all other clocks in the network are synchronized.
Broadly described, the invention implements an algorithm in which each node sends out a message to all the other nodes in the network periodically to tell its time.
If a node receives a message with a higher time than its own before it has had an opportunity to send out its own message, that node assumes that it is not the fastest node and it will not send out its message.
Provision is made for maximum and minimum delays that are expected within a particular network.
Simulation studies show that after a few cycles, all nodes will be synchronized and that only the fastest clock in the network will transmit its time.
What sets the implemented algorithm apart from others is its simplicity, its ability to synchronize clocks near optimally, and its optimal message complexity; i.
e.
, its ability to synchronize clocks using only one message per synchronization cycle.
As at least one message must be sent per synchronization cycle, this is clearly optimal.