US4454508A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Timed token ring
Assignee: Unisys Corp
•
Filing: 1983-05-31
•
Granted: 1984-06-12
•
Expires: 2003-05-31
Abstract
Abstract Disclosed is a timed token protocol which may be implemented either on a physical loop or a logical loop superimposed on a physical bus, the loop interconnecting a plurality of stations to form a network. Each station on the network may be of the same priority level, or may be of one or both of two priority levels. In the single priority level network, a station can transmit information upon the receipt of a write token if the time since the previous receipt of a write token is less than a preset amount of time, the difference between the observed write token rotation time and the preset amount of time representing the amount of unused capacity on the previous rotation of the write token.
Inventors
- 👤 Robert M. Grow
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 06:22
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
116 words
A method of allocating bandwidth in a communications network, said network including a set of stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself, extracting data or injecting data, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, said method comprising the steps of: a. each of said stations timing the rotation time of the write token to measure instantaneous load; and b. each of said stations limiting the transmission of information onto the network based on the observed write token rotation time.
Claim 2
Independent Claim
116 words
A method of allocating bandwidth in a communications network, said network including a set of stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself, extracting data or injecting data, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, said method comprising the steps of: a. each of said stations timing the rotation time of the write token to measure instantaneous load; and b. each of said stations limiting the transmission of information onto the network based on the observed write token rotation time.
Claim 3
Dependent Claim
70 words
The method in accordance with claim 1 wherein each station upon receipt of the write token measures the time duration since the previous receipt of the write token; and if the measured time duration is less than a predetermined time and that said station having received the write token has queued information to transmit, that said station having received the write token will transmit said queued information onto the network.
Claim 4
Dependent Claim
57 words
The method in accordance with claim 2 wherein that said station having received the write token will transmit its said queued information onto the network until the earlier of the transmission of all of its said queued information or the expiration of a time equal to the difference between said predetermined time and said measured time duration.
Claim 5
Dependent Claim
32 words
The method in accordance with claim 3 further including the step of that said station having received the write token transmitting the write token onto the network after transmitting said queued information.
Claim 6
Dependent Claim
37 words
The method in accordance with claim 2 wherein if the measured time duration is at least equal to the predetermined time, that said station having received the write token will transmit the write token onto the network.
Claim 7
Dependent Claim
135 words
The method in accordance with claim 5 wherein: if after transmission of information the measured time duration at the next write token reception by that said station is greater than the predetermined time, that said station having received the write token will accumulate the difference between the latter two times as a lateness time; on the next receipt of the write token by that said station, if the measured time duration is at least equal to said predetermined time, the difference in time will be added to the lateness time; if the measured time duration is less than the predetermined time, that said station will subtract the difference from the lateness time; and if the accumulated lateness time is not greater than zero, that said station will then transmit any queued information onto the network.
Claim 8
Dependent Claim
57 words
The method in accordance with claim 1 further including the steps of: each station measuring the time since that said station's last receipt of a write token; and if the measured time since that said station last received a write token exceeds a lost token time, that said station will initiate a write token recovery bidding process.
Claim 9
Dependent Claim
71 words
The method in accordance with claim 1 wherein said network is a logical loop communications network, said set of station being bus connected on a braodcast medium, and wherein a logical ordering of said stations is enforced by passing the write token from one of said stations to another in a predictable order with the last station in the order passing the write token to the first station in the order.
Claim 10
Dependent Claim
35 words
The method in accordance with claim 1 wherein said network is a loop communications network, said set of stations being loop connected to provide data flow unidirectionally from one of said stations to the next.
Claim 11
Dependent Claim
117 words
A station for use in a communications network, said network including a set of said stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself, extracting data or injecting data, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, wherein the improvement in each of said stations comprises: means in each station for timing the rotation time of the write token for measuring instantaneous load; and means in each station for limiting the transmission of information in response to the observed write token rotation time.
Claim 12
Dependent Claim
117 words
A station for use in a communications network, said network including a set of said stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself, extracting data or injecting data, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, wherein the improvement in each of said stations comprises: means in each station for timing the rotation time of the write token for measuring instantaneous load; and means in each station for limiting the transmission of information in response to the observed write token rotation time.
Claim 13
Dependent Claim
69 words
The station in accordance with claim 10 wherein each station includes: means for measuring the time between the receipt of said write token and the previous receipt of said write token; and means, responsive to the measured time duration being less than a predetermined time and said station having queued information to transmit, for the station having received said write token to transmit said queued information onto the network.
Claim 14
Dependent Claim
65 words
The station in accordance with claim 11 wherein each of said stations further includes means, responsive to having received said write token, said means for transmitting its said queued information onto the network until the earlier of the transmission of all of its said queued information or the expiration of a time equal to the difference between said predetermined time and said measured time duration.
Claim 15
Dependent Claim
24 words
The station in accordance with claim 12 wherein each of said stations includes means for transmitting the write token after transmitting said queued information.
Claim 16
Dependent Claim
36 words
The station in accordance with claim 13 wherein each of said stations includes means, responsive to the measured time duration being at least equal to said predetermined time, for transmitting the write token onto the network.
Claim 17
Dependent Claim
125 words
The station in accordance with claim 14 wherein each of said stations further includes: means, responsive to the measured time duration being greater than the predetermined time at the next write token reception following transmission of information, said means for accumulating the difference between the latter two times as a lateness time; means, responsive to the next receipt of said write token and a measured time duration at least equal to said predetermined time, for adding the difference in time to the lateness time; means, responsive to the measured time duration being less than the predetermined time, said means for subtracting the difference from the lateness time; and means, responsive to the accumulated lateness time not being greater than zero, for transmitting any queued information.
Claim 18
Dependent Claim
53 words
The station in accordance with claim 15 further including: means for measuring the time since that said station's last receipt of the write token; and means, responsive to the measured time since that said station last received the write token exceeding a lost token time, for initiating a write token recovery bidding process.
Claim 19
Dependent Claim
71 words
The method in accordance with claim 10 wherein said network is a logical loop communications network, said set of stations being bus connected on a broadcast medium, and wherein a logical ordering of said stations is enforced by passing the write token from one of said stations to another in a predictable order with the last station in the order passing the write token to the first station in the order.
Claim 20
Dependent Claim
35 words
The method in accordance with claim 10 wherein said network is a loop communications network, said set of stations being loop connected to provide data flow unidirectionally from one of said stations to the next.
Claim 21
Independent Claim
143 words
A method of allocating bandwidth in a communications network, said network including a set of stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself along the network, extracting data from the network or injecting data into the network, each of said stations being a Class 1 priority or a Class 2 priority, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, said method comprising the steps of: a. each of said Class 2 stations timing the rotation time of the write token to measure instantaneous load; and b. each of said Class 2 stations limiting the transmission of information onto the network based on the observed write token rotation time.
Claim 22
Independent Claim
143 words
A method of allocating bandwidth in a communications network, said network including a set of stations providing data flow unidirectionally from one of said stations to the next, each of said stations being capable of passing data through itself along the network, extracting data from the network or injecting data into the network, each of said stations being a Class 1 priority or a Class 2 priority, the right of each of said stations to source new information onto the network controlled by passing a write token from one of said stations to another, said method comprising the steps of: a. each of said Class 2 stations timing the rotation time of the write token to measure instantaneous load; and b. each of said Class 2 stations limiting the transmission of information onto the network based on the observed write token rotation time.
Claim 23
Dependent Claim
33 words
The method in accordance with claim 19 further including the step of allocating to the set of stations including all Class 1 stations a first portion of the bandwidth available on said network.
Claim 24
Dependent Claim
45 words
The method in accordance with claim 20 further including the step of each Class 1 station requiring bandwidth reserving a portion of the first portion of bandwidth, wherein the sum of the reserved Class 1 bandwidth does not exceed the first portion of the bandwidth.
Claim 25
Dependent Claim
77 words
The method in accordance with claim 19 wherein: each Class 2 station upon the receipt of the write token measures the time duration since the previous receipt of the write token; and if the measured time duration is less than a predetermined time and that said Class 2 station having received the write token has queued information to transmit, that said Class 2 station having received the write token will transmit said queued information onto the network.
Claim 26
Dependent Claim
59 words
The method in accordance with claim 22 wherein that said Class 2 station having received the write token will transmit its said queued information onto the network until the earlier of the transmission of all of its said queued information or the expiration of a time equal to the difference between said predetermined time and said measured time duration.
Claim 27
Dependent Claim
142 words
The method in accordance with claim 23 wherein: if after transmission of information the measured time duration at the next write token reception by that said Class 2 station is greater than the predetermined time, that said Class 2 station having received the write token will accumulate the difference between the latter two times as a lateness time; on the next receipt of the write token by that said Class 2 station, if the measured time duration is at least equal to said predetermined time, the difference in time will be added to the lateness time; if the measured time duration is less than the predetermined time, that said Class 2 station will subtract the difference from the lateness time; and if the accumulated lateness time is not greater than zero, that said Class 2 station will then transmit any queued information.
Claim 28
Dependent Claim
71 words
The method in accordance with claim 19 wherein said network is a logical loop communications network, said set of stations being bus connected on a broadcast medium, and wherein a logical ordering of said stations is enforced by passing the write token from one of said stations to another in a predictable order with the last station in the order passing the write token to the first station in the order.
Claim 29
Dependent Claim
35 words
The method in accordance with claim 19 wherein said network is a loop communications network, said set of stations being loop connected to provide data flow unidirectionally from one of said stations to the next.
References Cited (Backward Citations)
US4309371A
Cited
US4001504A
Cited
US4103288A
Cited
US4161719A
Cited
US4346440A
Cited
US4237553A
Cited
US4251880A
Cited
US4335426A
Cited
US4344180A
Cited
US4320520A
Cited
US4316284A
Cited
US4404557A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-06-12 | 1987-12-12 | 1988-06-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-06-12 | 1991-12-12 | 1992-06-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-06-12 | 1995-12-12 | 1996-06-12 | $7700.00 | Window Closed / Lapsed |