Patent US5313466A successfully refreshed from Google Patents.
US5313466A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Local synchronous bandwidth allocation in a token ring network
Assignee: Texas A&M University System
•
Filing: 1992-09-22
•
Granted: 1994-05-17
•
Expires: 2012-09-22
Abstract
Abstract A method for real time message transmission in a token ring network is provided. The method initializes each node in the network, including setting a maximum message transmission time Hi for node i such that <IMAGE> where Ci is the transmission time of a message in a message stream, Pi is the period length of the message stream, and a is a non-negative constant between zero and one. The messages are then transmitted when a token arrives at a node for the duration of Hi. Using this method with the timed token protocol, the synchronous messages are guaranteed to be transmitted before their deadlines if the utilization of synchronous messages is no more than <IMAGE> of available utilization.
Inventors
- 👤 Wei Zhao
- 👤 Biao Chen
- 👤 Gopal Agrawal
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 01:27
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/64; H04L12/6418; H04L12/28; H04L12/42; H04L12/427; H04L12/433; H04L2012/6432; H04L2012/6437; H04L2012/6445; H04L2012/6448; H04L2012/6451; H04L2012/6456
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
96 words
A method for real time message transmission in a token ring network having a plurality of nodes, comprising the steps of: initializing each node in the network, including setting a maximum message transmission time H i for each node i, ##EQU25## where C i is a transmission time of a message in a message stream, P i is the period length of the message stream, TTRT is a target token rotation time, and a is a non-negative constant; and transmitting said message stream when a token arrives at a node for duration of H i .
Claim 2
Independent Claim
96 words
A method for real time message transmission in a token ring network having a plurality of nodes, comprising the steps of: initializing each node in the network, including setting a maximum message transmission time H i for each node i, ##EQU25## where C i is a transmission time of a message in a message stream, P i is the period length of the message stream, TTRT is a target token rotation time, and a is a non-negative constant; and transmitting said message stream when a token arrives at a node for duration of H i .
Claim 3
Dependent Claim
15 words
The method, as set forth in claim 1, wherein said messages transmitted are synchronous messages.
Claim 4
Dependent Claim
51 words
The method, as set forth in claim 1, wherein said initializing step further comprises the steps of: determining a target token rotation time TTRT; setting a token rotation timer for node i to equal to said target token rotation time TTRT; and setting a late counter for node i to zero.
Claim 5
Dependent Claim
40 words
The method, as set forth in claim 3, further comprising the steps of: decrementing said token rotation timer; incrementing said late counter each time said token rotation timer reaches zero; and determining whether a token has arrived at node i.
Claim 6
Dependent Claim
24 words
The method, as set forth in claim 4, wherein the initializing step further comprises the step of setting a token holding timer to zero.
Claim 7
Dependent Claim
88 words
The method, as set forth in claim 5, further comprising the steps of: determining that said late counter is equal to zero; setting said token holding timer to the value of said token rotation timer; setting said token rotation timer to said target token rotation time; enabling the countdown of said taken rotation timer; transmitting synchronous messages for time H i ; enabling the countdown of said token holding timer; and transmitting asynchronous messages until one of said token rotation timer and said token holding timer reaches zero.
Claim 8
Dependent Claim
128 words
In a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, a method for allocating a maximum message transmission time H i for each node i, the method comprising the steps of: computing for H i , such that: ##EQU26## where C i is a transmission time of a message in a message stream, P i is a period length of the message stream, a is a non-negative constant; and TTRT is a target token rotation time; initializing each node i with respective computed H i ; and transmitting said messages when said token is captured by node i for the duration of respective computed H i .
Claim 9
Dependent Claim
128 words
In a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, a method for allocating a maximum message transmission time H i for each node i, the method comprising the steps of: computing for H i , such that: ##EQU26## where C i is a transmission time of a message in a message stream, P i is a period length of the message stream, a is a non-negative constant; and TTRT is a target token rotation time; initializing each node i with respective computed H i ; and transmitting said messages when said token is captured by node i for the duration of respective computed H i .
Claim 10
Dependent Claim
15 words
The method, as set forth in claim 7, wherein said transmitted messages are synchronous messages.
Claim 11
Dependent Claim
127 words
Apparatus for allocating a maximum message transmission time H i for node i in a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, the apparatus comprising: a processor computing for H i , such that: ##EQU27## where C i is a transmission time of a message in a message stream,P i is the period length of the message stream, TTRT is a target token rotation time, and a is a non-negative constant; means for initializing each said nodes with respective computed H i ; and means for transmitting said messages for the duration of respective computed H i when said token is received at node i.
Claim 12
Dependent Claim
127 words
Apparatus for allocating a maximum message transmission time H i for node i in a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, the apparatus comprising: a processor computing for H i , such that: ##EQU27## where C i is a transmission time of a message in a message stream,P i is the period length of the message stream, TTRT is a target token rotation time, and a is a non-negative constant; means for initializing each said nodes with respective computed H i ; and means for transmitting said messages for the duration of respective computed H i when said token is received at node i.
Claim 13
Dependent Claim
123 words
Apparatus for allocating a maximum message transmission time H i for node i in a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, the apparatus comprising: a processor computing for H i , such that: ##EQU28## where C i is a transmission of a message in a message stream, TTRT is a target token rotation time, and P i is the period length of the message stream; means for initializing each said nodes with respective computed H i ; and means for transmitting said synchronous messages for the duration of respective computed H i when said token is received at node i.
Claim 14
Dependent Claim
123 words
Apparatus for allocating a maximum message transmission time H i for node i in a token ring network connecting a plurality of nodes, said nodes communicating with one another by transmitting messages, and said nodes transmit said messages only when a token is received, the apparatus comprising: a processor computing for H i , such that: ##EQU28## where C i is a transmission of a message in a message stream, TTRT is a target token rotation time, and P i is the period length of the message stream; means for initializing each said nodes with respective computed H i ; and means for transmitting said synchronous messages for the duration of respective computed H i when said token is received at node i.
References Cited (Backward Citations)
US5191580A
Cited
US5155725A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-05-16 | 1997-11-15 | 1998-05-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-05-16 | 2001-11-15 | 2002-05-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-05-16 | 2005-11-15 | 2006-05-17 | $7700.00 | Window Closed / Lapsed |