US4680757A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of and apparatus for storing priority levels in token-ring network system
Assignee: Hitachi Ltd
•
Filing: 1986-04-15
•
Granted: 1987-07-14
•
Expires: 2006-04-15
Abstract
Abstract In each node accommodated in a token-ring network system, a storage unit for storing priority levels is constituted by a plurality of flip-flops which provide bit positions of the same number as that of grades of the priority level. When storing a value of priority level which is higher than a value of priority level stored in the storage unit, the corresponding flip-flop of the storage unit is set. Two priority encoders connected to the output of the storage unit detect, from data of priority level stored in the storage unit, first and second priority levels and load then on registers, respectively. In accordance with the contents of the registers, the corresponding flip-flop of the storage unit is rest, when each node detects a value of priority level stored in the storage unit.
Inventors
- 👤 Toshiyuki Murakami
- 👤 Norihiko Sugimoto
- 👤 Naoki Ogawa
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 00:43
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
265 words
A method of storing priority levels in a token-ring network system having a ring transmission link and a plurality of nodes accommodated in the ring transmission link, each node being capable of transmitting/receiving a token and a frame, wherein each node can reserve in a frame being passed through said transmission link a priority level for a frame that the node of its own requests for transmission and can transmit the frame of its own requested for transmission when acquiring a right to transmission by receiving a token, said method comprising, for storing priority levels at each node, the steps of: reading, upon receipt of the frame transmitted from its own node, values of current and reservation priority levels; compairing the read values of both the priority levels and storing, when the value of reservation level is higher than the value of current priority level, said value of reservation level in storing means having the same number of bits as that of grades of the priority level with bit positions respectively corresponding to values of the priority level, by setting to one state a value at a bit position of said storing means corresponding to at least said value of reservation level; reading, upon receipt of a token, a value of current priority level in said token; and comparing the read value of priority level in said token with the highest value of priority levels stored in said storing means and upon coincidence, resetting to the other state a value at a bit position of said storing means corresponding to at least said highest value.
Claim 2
Independent Claim
265 words
A method of storing priority levels in a token-ring network system having a ring transmission link and a plurality of nodes accommodated in the ring transmission link, each node being capable of transmitting/receiving a token and a frame, wherein each node can reserve in a frame being passed through said transmission link a priority level for a frame that the node of its own requests for transmission and can transmit the frame of its own requested for transmission when acquiring a right to transmission by receiving a token, said method comprising, for storing priority levels at each node, the steps of: reading, upon receipt of the frame transmitted from its own node, values of current and reservation priority levels; compairing the read values of both the priority levels and storing, when the value of reservation level is higher than the value of current priority level, said value of reservation level in storing means having the same number of bits as that of grades of the priority level with bit positions respectively corresponding to values of the priority level, by setting to one state a value at a bit position of said storing means corresponding to at least said value of reservation level; reading, upon receipt of a token, a value of current priority level in said token; and comparing the read value of priority level in said token with the highest value of priority levels stored in said storing means and upon coincidence, resetting to the other state a value at a bit position of said storing means corresponding to at least said highest value.
Claim 3
Dependent Claim
30 words
A priority level storing method according to claim 1 wherein said storage means is register means including the same number of flip-flops as that of grades of the priority level.
Claim 4
Dependent Claim
90 words
A priority level storing method according to claim 1 wherein the values of priority levels are encoded so that the token and frame contain coded values, the value of reservation level to be stored is decoded and thereafter supplied to said storing means in the step of storing said value, and in the step of resetting the bit position of said storing means, said highest value of priority levels stored in said storing means is encoded and thereafter compared with the value of priority level read out of said token.
Claim 5
Dependent Claim
50 words
A priority level storing method according to claim 1 wherein the value of priority levels contained in the token and frame is constituted by a plurality of bits which are identical in number to grades of the priority level with bit positions respectively corresponding to values of the priority level.
Claim 6
Independent Claim
241 words
An apparatus for storing priority levels in a token-ring network system having a ring transmission link and a plurality of nodes accommodated in the ring transmission link, each node being capable of transmitting/receiving a token and a frame, wherein each node can reserve in a frame being passed through said transmission link a priority level for a frame that the node of its own requests for transmission and can transmit the frame of its own requested for transmission when acquiring a right to transmission by receiving a token, said apparatus included in each node comprising: first and second register means for temporarily storing values of current and reservation priority levels, respectively; storage means having the same number of bits as that of grades of the priority level with bit positions respectively corresponding to values of the priority level; means connected to said storage means, for detecting the highest value and the secondly high value of priority levels stored in said storage means; third and fourth register means connected to said detecting means, for temporarily storing the detected highest value and secondly high value of priority levels, respectively; and control means connected to said first, second, third and fourth register means as well as to said storage means, for selectively supplying values of priority levels stored in said register means to said storage means and changing values at bit positions of said storage means corresponding to the selected values of priority levels.
Claim 7
Independent Claim
241 words
An apparatus for storing priority levels in a token-ring network system having a ring transmission link and a plurality of nodes accommodated in the ring transmission link, each node being capable of transmitting/receiving a token and a frame, wherein each node can reserve in a frame being passed through said transmission link a priority level for a frame that the node of its own requests for transmission and can transmit the frame of its own requested for transmission when acquiring a right to transmission by receiving a token, said apparatus included in each node comprising: first and second register means for temporarily storing values of current and reservation priority levels, respectively; storage means having the same number of bits as that of grades of the priority level with bit positions respectively corresponding to values of the priority level; means connected to said storage means, for detecting the highest value and the secondly high value of priority levels stored in said storage means; third and fourth register means connected to said detecting means, for temporarily storing the detected highest value and secondly high value of priority levels, respectively; and control means connected to said first, second, third and fourth register means as well as to said storage means, for selectively supplying values of priority levels stored in said register means to said storage means and changing values at bit positions of said storage means corresponding to the selected values of priority levels.
Claim 8
Dependent Claim
174 words
A priority level storing apparatus according to claim 5 wherein said control means includes: first comparator means connected to said first and third register means, for comparing the values of priority levels of both the register means; second comparator means connected to said first and second register means, for comparing the values of priority levels of both the register means; third comparator means connected to said second and fourth register means, for comparing the values of priority levels of both the register means; a selector circuit connected to said first to fourth register means, for selecting one of the values of priority levels of said register means and supplying the selected one value to said storage means; and a priority level judging circuit connected to said comparator means, selector circuit and storage means and being responsive to comparison results from said comparator means, for controlling said selector circuit and storage means so as to change a value at a bit position of said storage means corresponding to said selected one value of priority level.
Claim 9
Dependent Claim
55 words
A priority level storing apparatus according to claim 5 wherein said first to fourth register means temporarily store encoded values of priority levels, decoder means is interposed between said control means and said storage means, and first and second encoder means are interposed between said detecting means and said third and fourth register means, respectively.
Claim 10
Dependent Claim
57 words
A priority level storing apparatus according to claim 5 wherein said storage means includes: the same number of RS flip-flops as that of grades of the priority level; and gate means connected to R and S input terminals of each flip-flop, for selectively setting or resetting a flip-flop corresponding to said selected one value of priority level.
Claim 11
Dependent Claim
93 words
A priority level storing apparatus according to claim 5 wherein said detecting means includes: a first priority encoder connected to said storage means, for preparing the highest value of priority levels from the values stored in said storage means; means connected to said first priority encoder and said storage means, for eliminating from the values stored in said storage means a value at a bit position corresponding to said highest value of priority level; and a second priority encoder connected to said gate means, for preparing the secondly high value of priority level.
References Cited (Backward Citations)
US4404557A
Cited
US4454508A
Cited
US4459588A
Cited
US4609920A
Cited
US4604742A
Cited
US4566097A
Cited
US4602365A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-07-13 | 1991-01-12 | 1991-07-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-07-13 | 1995-01-12 | 1995-07-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-07-13 | 1999-01-12 | 1999-07-14 | $7700.00 | Window Closed / Lapsed |