US4593280A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Write token regeneration in a timed token ring
Assignee: Unisys Corp
•
Filing: 1982-07-26
•
Granted: 1986-06-03
•
Expires: 2002-07-26
Abstract
Abstract Disclosed is a bidding method for regenerating a lost write token in a token controlled loop communications network. In response to a station on the loop detecting the loss of the write token, the station will generate a unique recovery token specifying as the destination address that station's individual address and transmit the generated recovery token onto the loop. Stations receiving the recovery token will examine the recovery token's destination address and based on a bidding method, will either pass the recovery token on unaltered or substitute the receiving station's individual address if the recovery token's destination address is not equal to the receiving station's individual address. When a receiving station's individual address matches that specified in the recovery token, that station wins the bid and generates a new write token. The method disclosed can also be used to generate a write token when the network is initialized.
Inventors
- 👤 Robert M. Grow
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 00:30
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
177 words
In a loop communications 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 individual 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, only one of said write tokens circulating around the loop under normal conditions, a method of generating said write token at initialization of said network or regenerating a lost write token, said method comprising the steps of: each station measuring the time duration since the last receipt of said write token; and in response to a first one of said stations detecting that said measured time duration exceeds a preset amount of time, said first one of said stations will initiate a bidding cycle to recover the write token.
Claim 2
Dependent Claim
177 words
In a loop communications 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 individual 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, only one of said write tokens circulating around the loop under normal conditions, a method of generating said write token at initialization of said network or regenerating a lost write token, said method comprising the steps of: each station measuring the time duration since the last receipt of said write token; and in response to a first one of said stations detecting that said measured time duration exceeds a preset amount of time, said first one of said stations will initiate a bidding cycle to recover the write token.
Claim 3
Dependent Claim
57 words
The method in accordance with claim 1 wherein said bidding cycle includes the following steps: said first station generating a recovery token, said recovery token including a destination address, the destination address in the recovery token generated including the individual address associated with said first station; said first station transmitting said generated recovery token onto the loop.
Claim 4
Dependent Claim
143 words
The method in accordance with claim 2 further including the following additional steps: each one of said stations receiving one of said recovery tokens comparing the destination address in that said received recovery token with the individual address associated with that said receiving station; if the destination address in that said received recovery token is greater than the individual address associated with that said receiving station, that said receiving station will transmit that said received recovery token back onto the loop with the destination address unaltered; and if the destination address in that said received recovery token is less than the individual address associated with that said receiving station, that said receiving station will replace the destination address in that said recovery token with the individual address associated with that said receiving station and transmit the modified recovery token back onto the loop.
Claim 5
Dependent Claim
143 words
The method in accordance with claim 2 further including the following additional steps: each one of said stations receiving one of said recovery tokens comparing the destination address in that said received recovery token with the individual address associated with that said receiving station; if the destination address in that said received recovery token is less than the individual address associated with that said receiving station, that said receiving station will transmit that said received recovery token back onto the loop with the destination address unaltered; and if the destination address in that said received recovery token is greater than the individual address associated with that said receiving station, that said receiving station will replace the destination address in that said recovery token with the individual address associated with that said receiving station and transmit the modified recovery token back onto the loop.
Claim 6
Dependent Claim
55 words
The method in accordance with claim 3 or 4 further including the following additional steps: if the destination address in that said received recovery token is equal to the individual address of that said receiving station, that said receiving station will generate a new write token and transmit the new write token onto the loop.
Claim 7
Dependent Claim
32 words
The method in accordance with claim 5 wherein the individual address associated with each one of said stations is uniquely different than the individual address associated with other ones of said stations.
Claim 8
Dependent Claim
50 words
The method in accordance with claim 5 wherein said preset amount of time is dependent on a target token rotation time, the target token rotation time chosen so that under a one hundred percent offered load on the loop, the write token will revolve at the target token rotation time.
Claim 9
Dependent Claim
62 words
The method in accordance with claim 5 further including the steps of: assigning to each of said stations on the loop a Class 1 priority, a Class 2 priority, or both of said Class 1 and Class 2 priorities; and each of said Class 2 stations limiting the transmission of information onto the loop based on the observed write token rotation time.
Claim 10
Dependent Claim
67 words
The method in accordance with claim 8 further including the steps of: allocating to the set of stations including all Class 1 stations a first portion of the bandwidth available on said loop; and 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 11
Dependent Claim
54 words
The method in accordance with claim 5 further including the steps of: assigning to each one of a first subset of said stations on the loop a Class 2 priority; and each of said Class 2 priority stations limiting the transmission of information onto the loop based on the observed write token rotation time.
Claim 12
Dependent Claim
83 words
The method in accordance with claim 10 further including the steps of: assigning to each one of a second subset of said stations on the loop a Class 1 priority; allocating to the second subset of said stations a first portion of the bandwidth available on said loop; and each Class 1 priority 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 13
Dependent Claim
193 words
In a logical loop communications network, said network including a bus connected set of stations on a broadcast medium wherein a logical ordering of said stations is enforced by passing a 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, each of said stations being capable of passing data through itself along the logical loop, extracting data from the logical loop or injecting data into the logical loop, each of said stations having associated with it at least one individual address, only one of said write tokens circulating around the logical loop under normal conditions, a method of generating said write token at initialization of said network or regenerating a lost write token, said method comprising the steps of: each station measuring the time duration since the last receipt of said write token; and in response to a first one of said stations detecting that said measured time duration exeeds a preset amount of time, said first one of said stations will initiate a bidding cycle to recover the write token.
Claim 14
Dependent Claim
193 words
In a logical loop communications network, said network including a bus connected set of stations on a broadcast medium wherein a logical ordering of said stations is enforced by passing a 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, each of said stations being capable of passing data through itself along the logical loop, extracting data from the logical loop or injecting data into the logical loop, each of said stations having associated with it at least one individual address, only one of said write tokens circulating around the logical loop under normal conditions, a method of generating said write token at initialization of said network or regenerating a lost write token, said method comprising the steps of: each station measuring the time duration since the last receipt of said write token; and in response to a first one of said stations detecting that said measured time duration exeeds a preset amount of time, said first one of said stations will initiate a bidding cycle to recover the write token.
Claim 15
Dependent Claim
58 words
The method in accordance with claim 12 wherein said bidding cycle includes the following steps: said first station generating a recovery token, said recovery token inlcuding a destination address, the destination address in the recovery token generated including the individual address associated with said first station; said first station transmitting said generated recovery token onto the logical loop.
Claim 16
Dependent Claim
145 words
The method in accordance with claim 13 further including the following additional steps: each one of said stations receiving one of said recovery tokens comparing the destination address in that said received recovery token with the individual address associated with that said receiving station; if the destination address in that said received recovery token is greater than the individual address associated with that said receiving station, that said receiving station will transmit that said received recovery token back onto the logical loop with the destination address unaltered; and if the destination address in that said received recovery token is less than the individual address associated with that said receiving station, that said receiving station will replace the destination address in that said recovery token with the individual address associated with that said receiving station and transmit the modified recovery token back onto the logical loop.
Claim 17
Dependent Claim
145 words
The method in accordance with claim 13 further including the following additional steps: each one of said stations receiving one of said recovery tokens comparing the destination address in that said received recovery token with the individual address associated with that said receiving station; if the destination address in that said received recovery token is less than the individual address associated with that said receiving station that said receiving station will transmit that said received recovery token back onto the logical loop with the destination address unaltered; and if the destination address in that said received recovery token is greater than the individual address associated with that said receiving station, that said receiving station will replace the destination address in that said recovery token with the individual address associated with that said receiving station and transmit the modified recovery token back onto the logical loop.
References Cited (Backward Citations)
US3903371A
Cited
US4001504A
Cited
US4103288A
Cited
US4161719A
Cited
EP0006325A1
Cited
US4346440A
Cited
US4237553A
Cited
US4287592A
Cited
US4251880A
Cited
US4335426A
Cited
US4344180A
Cited
US4320520A
Cited
US4316284A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-06-02 | 1989-12-02 | 1990-06-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-06-02 | 1993-12-02 | 1994-06-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-06-02 | 1997-12-02 | 1998-06-03 | $7700.00 | Window Closed / Lapsed |