Clock synchronization algorithm for address independent networks
US5001730A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Mar 31, 1989 |
| Grant date | Mar 19, 1991 |
| Priority date | — |
| Expiry date | Mar 31, 2009 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F1/14
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
A distributed algorithm for clock synchronization in address independent networks such as token rings and token busses is described. Synchronization is accomplished by using the fastest clock in the network as the master clock against which all other clocks in the network are synchronized. An algorithm is implemented in which each node sends out a message to all the other nodes in the network when its timer times out to tell its time. If a node receives a message with a higher clock time 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. It has been proven that after a few cycles, all nodes will be synchronized to the node with the fastest clock and that this node will be the only one to transmit its time.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.