US4939753A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Time synchronization of control networks
Assignee: Fisher Rosemount Systems Inc
•
Filing: 1989-02-24
•
Granted: 1990-07-03
•
Expires: 2009-02-24
Abstract
Abstract A distributed computer network is synchronized as to time provided to each peerway and its associated stations or nodes. Highway interface adapters (HIAs) serve as time references for each node on a peerway and as communication links between peerways. At periodic intervals, each HIA transmits a Time Interval Control packet (TIC) including the time of day and an ordinal number denoting the HIA priority in the network and a distance factor. By comparing ordinal numbers, an HIA will adjust its clock to the TIC packet being transmitted from the HIA with the highest priority and the smallest distance. This ensures that a synchronized time is provided to each node on the network from a single source over an optimal distance.
Inventors
- 👤 Gene H. Olson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 10:49
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04J; H04J3/00; H04J3/02; H04J3/06; H04J3/0635; H04J3/0679
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
185 words
A method of time synchronization in a distributed computer network formed by a plurality of peerways capable of communication with one another, each peerway including a plurality of nodes which communicate with one another over a communication medium and at least one node of each peerway being a Highway Interface Adapter (HIA) capable of transmitting and receiving data from at least one HIA of another peerway; the method comprising: periodically transmitting, from each HIA to other nodes and to at least one other HIA, data including a time value and an ordinal containing priority information; comparing at each HIA an ordinal containing priority information contained in data received from another HIA with an ordinal containing priority information currently being used by the HIA; and adopting at each HIA, for subsequent transmission the ordinal contained in data received from another HIA and the time value contained in that data, if the ordinal contained in that data received has a higher priority than the ordinal currently being used which indicates that the HIA from which data was received is preferred as a source of the time value.
Claim 2
Independent Claim
185 words
A method of time synchronization in a distributed computer network formed by a plurality of peerways capable of communication with one another, each peerway including a plurality of nodes which communicate with one another over a communication medium and at least one node of each peerway being a Highway Interface Adapter (HIA) capable of transmitting and receiving data from at least one HIA of another peerway; the method comprising: periodically transmitting, from each HIA to other nodes and to at least one other HIA, data including a time value and an ordinal containing priority information; comparing at each HIA an ordinal containing priority information contained in data received from another HIA with an ordinal containing priority information currently being used by the HIA; and adopting at each HIA, for subsequent transmission the ordinal contained in data received from another HIA and the time value contained in that data, if the ordinal contained in that data received has a higher priority than the ordinal currently being used which indicates that the HIA from which data was received is preferred as a source of the time value.
Claim 3
Dependent Claim
48 words
The method of claim 1 including forming each ordinal with a priority field containing data representative of a priority of the HIA transmitting the data, and a distance field containing data representative of a preferred path between the HIA transmitting the data and the HIA receiving the data.
Claim 4
Dependent Claim
27 words
The method of claim 2 wherein forming each ordinal with data representative of a preferred path includes forming each ordinal with data representative of a shortest path.
Claim 5
Dependent Claim
59 words
The method of claim 2 wherein adopting at each HIA the ordinal contained in data received from another HIA comprises adopting at each HIA the ordinal contained in data received from another HIA if the ordinal received from the HIA has a higher priority field and a smaller distance field than the priority and distance of the receiving HIA.
Claim 6
Dependent Claim
23 words
The method of claim 1 wherein periodically transmitting data includes transmitting a time correction factor for adjusting the clock of the receiving HIA.
Claim 7
Dependent Claim
24 words
The method of claim 1 including adopting at each HIA an intrinsic ordinal if the HIA stops receiving the time value from another HIA.
Claim 8
Dependent Claim
37 words
The method of claim 6 wherein adopting at each HIA an intrinsic ordinal if the HIA stops receiving the time value from another HIA includes waiting a stabilization period before adopting an ordinal received from another HIA.
Claim 9
Independent Claim
174 words
A method of time synchronization in a distributed computer network formed by at least one communication link including at least one Highway Interface Adapter (HIA) capable of transmitting and receiving data on the communication link, the method comprising: each HIA periodically transmitting, on the communication link, data including a time value and an ordinal containing priority information; receiving at each HIA transmissions including an ordinal containing priority information and a time value, from any other HIA transmitting on the communication link; comparing at a receiving HIA the ordinal received from any other HIA transmitting on the communication link, with the ordinal currently being used by the receiving HIA; and adopting at the receiving HIA for subsequent transmission, the ordinal contained in data received from any other HIA transmitting on the communication link if the ordinal contained in the data received has a higher priority than the ordinal currently being used by the receiving HIA which indicates that the HIA from which the data was received is preferred as a source of the time value.
Claim 10
Independent Claim
174 words
A method of time synchronization in a distributed computer network formed by at least one communication link including at least one Highway Interface Adapter (HIA) capable of transmitting and receiving data on the communication link, the method comprising: each HIA periodically transmitting, on the communication link, data including a time value and an ordinal containing priority information; receiving at each HIA transmissions including an ordinal containing priority information and a time value, from any other HIA transmitting on the communication link; comparing at a receiving HIA the ordinal received from any other HIA transmitting on the communication link, with the ordinal currently being used by the receiving HIA; and adopting at the receiving HIA for subsequent transmission, the ordinal contained in data received from any other HIA transmitting on the communication link if the ordinal contained in the data received has a higher priority than the ordinal currently being used by the receiving HIA which indicates that the HIA from which the data was received is preferred as a source of the time value.
Claim 11
Dependent Claim
36 words
The method of claim 8 including forming each ordinal with a priority field containing data representative of a priority of the HIA transmitting the data, and a distance field containing data representative of a preferred path.
Claim 12
Dependent Claim
27 words
The method of claim 9 wherein forming each ordinal with data representative of a preferred path includes forming each ordinal with data representative of a shortest path.
Claim 13
Dependent Claim
63 words
The method of claim 9 wherein adopting at the receiving HIA the ordinal contained in data received from any another HIA comprises adopting at the receiving HIA the ordinal contained in data received from any other HIA if the ordinal received from the HIA has a higher priority field and a smaller distance field than the priority and distance of the receiving HIA.
Claim 14
Dependent Claim
23 words
The method of claim 9 wherein periodically transmitting data includes transmitting a time correction factor for adjusting the clock of the receiving HIA.
Claim 15
Dependent Claim
24 words
The method of claim 8 including adopting at each HIA an intrinsic ordinal if the HIA stops receiving the time value from another HIA.
Claim 16
Dependent Claim
36 words
The method of claim 13 wherein adopting at each HIA an intrinsic ordinal if the HIA stops receiving the time value from HIA includes waiting a stabilization period before adopting an ordinal received from another HIA.
Claim 17
Independent Claim
115 words
An apparatus for providing time in a computer network through a preferred communications path, the apparatus comprising: ordinal memory means for containing information comprising an ordinal containing priority information; means for keeping time; means for transmitting data on the computer network, the data including the ordinal and a time value; means for receiving ordinal and time value data from the computer network, the ordinal data containing priority information; and means for storing the received ordinal data in the ordinal memory means if the received ordinal data has a higher priority than the ordinal stored in the ordinal memory means which indicates that received time value data is preferred as a source of the time value.
Claim 18
Independent Claim
115 words
An apparatus for providing time in a computer network through a preferred communications path, the apparatus comprising: ordinal memory means for containing information comprising an ordinal containing priority information; means for keeping time; means for transmitting data on the computer network, the data including the ordinal and a time value; means for receiving ordinal and time value data from the computer network, the ordinal data containing priority information; and means for storing the received ordinal data in the ordinal memory means if the received ordinal data has a higher priority than the ordinal stored in the ordinal memory means which indicates that received time value data is preferred as a source of the time value.
Claim 19
Dependent Claim
77 words
The apparatus of claim 15 wherein the means for storing includes means for comparing data representative of the priority of the received time value data contained in a priority field in the received ordinal with a priority field in the ordinal contained in the ordinal memory means, and data representative of the preferred communications path contained in a distance field in the received ordinal with a distance field in the ordinal contained in the ordinal memory means.
Claim 20
Dependent Claim
15 words
The apparatus of claim 16 wherein the means for comparing selects a shortest possible path.
Claim 21
Dependent Claim
21 words
The apparatus of claim 15 wherein the transmitted data includes a time correction factor for adjusting the means for keeping time.
Claim 22
Dependent Claim
41 words
The apparatus of claim 15 including means for storing an intrinsic ordinal in the ordinal memory means if ordinal and time value data are not being received by the means for receiving ordinal and time value data from the computer network.
Claim 23
Dependent Claim
24 words
The apparatus of claim 19 wherein the means for storing an intrinsic ordinal in the ordinal memory means includes a stabilization time delay means.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-07-02 | 1994-01-01 | 1994-07-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-07-02 | 1998-01-01 | 1998-07-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-07-02 | 2002-01-01 | 2002-07-03 | $7700.00 | Window Closed / Lapsed |