US4404557A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Timed token ring with multiple priorities
Assignee: Unisys Corp
•
Filing: 1982-03-05
•
Granted: 1983-09-13
•
Expires: 2002-03-05
Abstract
Abstract A timed token protocol for use in a local area loop communications network is disclosed. The protocol provides three classes of service with a priority relationship between classes. The three classes allow guaranteed bandwidth, interactive and batch services. The classes are implemented by timing the rotation time of a write token to measure instantaneous load. Transmission of information is limited by class of service and the measured write token rotation time. Also disclosed is a hardware embodiment of a loop communications station which implements the timed token protocol.
Inventors
- 👤 Robert M. Grow
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 11:21
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
168 words
A method of allocating bandwidth in a loop communications network, said network including a loop-connected 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 loop, extracting data from the loop or injecting data into the loop, each of said stations having associated with it at least one identifier address, each of said stations being assigned a Class 1 priority, a Class 2 priority, or both of said Class 1 and Class 2 priorities, the right of each of said stations to source new information into 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 loop based on the observed write token rotation time.
Claim 2
Independent Claim
168 words
A method of allocating bandwidth in a loop communications network, said network including a loop-connected 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 loop, extracting data from the loop or injecting data into the loop, each of said stations having associated with it at least one identifier address, each of said stations being assigned a Class 1 priority, a Class 2 priority, or both of said Class 1 and Class 2 priorities, the right of each of said stations to source new information into 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 loop based on the observed write token rotation time.
Claim 3
Dependent Claim
33 words
The method in accordance with claim 1 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 loop.
Claim 4
Dependent Claim
45 words
The method in accordance with claim 2 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 5
Dependent Claim
39 words
The method in accordance with claim 3 further including a step wherein each Class 1 station that has reserved bandwidth and subsequently determines that it does not require its reserved bandwidth may surrender a portion of its reserved bandwidth.
Claim 6
Dependent Claim
33 words
The method in accordance with claim 2 further including the step of allocating to the class of stations including all Class 2 stations a second portion of the bandwidth available on said loop.
Claim 7
Dependent Claim
70 words
The method in accordance with claim 5 wherein: each Class 2 station upon the receipt of a write token measures the time duration since the previous receipt of a write token; and if the measured time duration is less than a predetermined time and that Class 2 station has queued information to transmit, the Class 2 station having received the write token will transmit said queued information onto the loop.
Claim 8
Dependent Claim
59 words
The method in accordance with claim 6 wherein that said Class 2 station having received the write token will transmit its said queued information onto the loop 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 9
Dependent Claim
31 words
The method in accordance with claim 6 or 7 further including the step of said Class 2 station transmitting a new write token onto the loop after transmitting said queued information.
Claim 10
Dependent Claim
58 words
The method in accordance with claim 5 wherein: each Class 2 station upon the receipt of a write token measures the time duration since the previous receipt of a write token; and if the measured time duration is at least equal to a predetermined time, that Class 2 station will transmit a new write token onto the loop.
Claim 11
Dependent Claim
119 words
The method in accordance with claim 9 wherein: if after transmission of information the measured time duration at the next write token reception is greater than the predetermined time, the Class 2 station will accumulate this lateness time; on the next receipt of the write token by 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, the Class 2 station will subtract the difference from the lateness time; and if the accumulated lateness time is not greater than zero, the Class 2 station will then transmit any queued information.
Claim 12
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 13
Dependent Claim
56 words
The method in accordance with claim 3 further including the steps of: each Class 1 station checking whether the bandwidth reserved by Class 1 stations exceeds the first portion of the bandwidth; and if the Class 1 bandwidth reserved exceeds the first portion, each said Class 1 station will surrender a portion of its reserved bandwidth.
Claim 14
Dependent Claim
177 words
A station for use in a loop communications network, said network including a loop connected 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 along the loop, extracting data from the loop or injecting data into the loop, each of said stations having associated with it at least one identifier address, the right of each of said stations to source new information into 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 for assigning each of said stations a Class 1 priority, a Class 2 priority, or both a Class 1 and 2 priority; means in each Class 2 priority station for timing the rotation time of the write token for measuring instantaneous load on the loop; and means in each Class 2 priority station for limiting the transmission of information onto the loop in response to the observed write token rotation time.
Claim 15
Dependent Claim
177 words
A station for use in a loop communications network, said network including a loop connected 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 along the loop, extracting data from the loop or injecting data into the loop, each of said stations having associated with it at least one identifier address, the right of each of said stations to source new information into 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 for assigning each of said stations a Class 1 priority, a Class 2 priority, or both a Class 1 and 2 priority; means in each Class 2 priority station for timing the rotation time of the write token for measuring instantaneous load on the loop; and means in each Class 2 priority station for limiting the transmission of information onto the loop in response to the observed write token rotation time.
Claim 16
Dependent Claim
46 words
The station in accordance with claim 13 wherein each of said Class 1 stations includes means for specifying a first portion of the bandwidth available on said loop, said first portion corresponding to the bandwidth allocated to the set of stations including all Class 1 stations.
Claim 17
Dependent Claim
42 words
The station in accordance with claim 14 wherein each Class 1 station further includes means for reserving a portion of the first portion of bandwidth, wherein the sum of reserved Class 1 bandwidth does not exceed the first portion of the bandwidth.
Claim 18
Dependent Claim
38 words
The station in accordance with claim 15 wherein each class 1 station that has reserved bandwidth includes means for determining that it no longer requires its reserved bandwidth and means for surrendering a portion of its reserved bandwidth.
Claim 19
Dependent Claim
47 words
The station in accordance with claim 14 wherein each of said Class 2 stations means for specifying a second portion of the bandwidth available on said loop, said second portion corresponding to the pool of bandwidth allocated to the set of stations including all Class 2 stations.
Claim 20
Dependent Claim
79 words
The station in accordance with claim 17 wherein each Class 2 station includes: means for measuring the time between the receipt of one of said write tokens and the previous receipt of one of said write tokens; and means, responsive to the measured time duration being less than a predetermined time and said Class 2 station having queued information to transmit, for the Class 2 station having received said write token to transmit said queued information onto said loop.
Claim 21
Dependent Claim
69 words
The station in accordance with claim 18 wherein each of said Class 2 stations further includes means, responsive to having received one of said write tokens, said means for transmitting its said queued information onto the loop 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 22
Dependent Claim
32 words
The station in accordance with claim 18 or 19 wherein each of said Class 2 stations includes means for transmitting a new write token onto the loop after transmitting said queued information.
Claim 23
Dependent Claim
62 words
The station in accordance with claim 17 wherein: each of said Class 2 stations includes means, responsive to the receipt of a write token, for measuring the time duration since the previous receipt of a write token; and means, responsive to the measured time duration being at least equal to a predetermined time, for transmitting a new write token onto the loop.
Claim 24
Dependent Claim
121 words
The station in accordance with claim 21 wherein each of said Class 2 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 this lateness time; means, responsive to the next receipt of one of said write tokens 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 25
Dependent Claim
53 words
The station in accordance with claim 13 further including: means for measuring the time since that said station's last receipt of a write token; and means, responsive to the measured time since that said station last received a write token exceeding a lost token time, for initiating a write token recovery bidding process.
Claim 26
Dependent Claim
52 words
The station in accordance with claim 15 wherein each Class 1 station includes: means for checking whether the bandwidth reserved by Class 1 stations exceeds the first portion of the bandwidth; and means, responsive to the reserved Class 1 bandwidth exceeding the first portion, for surrendering a portion of its reserved bandwidth.
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) | 1986-09-12 | 1987-03-14 | 1987-09-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-09-12 | 1991-03-14 | 1991-09-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-09-12 | 1995-03-14 | 1995-09-13 | $7700.00 | Window Closed / Lapsed |