US5526356A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Ring communication network node apparatus with buffers and method for controlling the same
Assignee: Electronics and Telecommunications Research Institute
•
Filing: 1994-11-30
•
Granted: 1996-06-11
•
Expires: 2014-11-30
Abstract
Abstract A node apparatus of such a ring communication network including buffers capable of improving a performance of the ring communication network and yet maintaining a global fairness in use of a ring communication network bandwidth among nodes, and a method for controlling the node apparatus. The node apparatus includes a receiver unit for receiving packets and slots from a ring, an ordering buffering unit for ordering the packets, a receiving queuing unit for temporarily storing messages of the packets to be sent to a host, a trunk buffering unit for temporarily storing packets to be transmitted to other nodes and then relaying the stored packets, a transmitting queuing unit for storing messages to be transmitted to the ring, and a transmitter unit for transmitting packets and messages in a medium access control manner. The control method includes the first step of checking about a destination node for a packet received to a node, the second step of processing the packet when the destination node corresponds to the packet-received node, the third step of processing the packet in a manner different from the second step when the destination node corresponds to a node other than the packet-received node, the fourth step of processing the packet at an empty state and the fifth step of processing the packet at a seizure state.
Inventors
- 👤 Tae J. Kim
- 👤 Won Ryu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 05:47
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433; H04L47/00; H04L47/10; H04L49/00; H04L49/10; H04L49/112; H04L49/90; H04L49/9047
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
151 words
A node apparatus for a ring communication network comprising: receiver means for receiving packets and slots from a ring; ordering buffering means for ordering the packets disorderly received from the receiver means; receiving queuing means for temporarily storing messages of the packets ordered by the ordering buffering means so as to send the messages to a host; trunk buffering means for temporarily storing packets to be transmitted from the receiver means to other nodes and then relaying the stored packets, the trunk buffering means having a predetermined trunk interval; transmitting queuing means for storing messages to be transmitted from the host to the ring, the transmitting queuing means having a predetermined transmission interval; and transmitter means for transmitting to the ring in a medium access control manner: packets directly delivered from the receiver means, the packets stored in the trunk buffering means, and the messages stored in the transmitting queuing means.
Claim 2
Dependent Claim
151 words
A node apparatus for a ring communication network comprising: receiver means for receiving packets and slots from a ring; ordering buffering means for ordering the packets disorderly received from the receiver means; receiving queuing means for temporarily storing messages of the packets ordered by the ordering buffering means so as to send the messages to a host; trunk buffering means for temporarily storing packets to be transmitted from the receiver means to other nodes and then relaying the stored packets, the trunk buffering means having a predetermined trunk interval; transmitting queuing means for storing messages to be transmitted from the host to the ring, the transmitting queuing means having a predetermined transmission interval; and transmitter means for transmitting to the ring in a medium access control manner: packets directly delivered from the receiver means, the packets stored in the trunk buffering means, and the messages stored in the transmitting queuing means.
Claim 3
Dependent Claim
53 words
A node apparatus in accordance with claim 1, further comprising ring buffering means which, when the ring communication network operates in a ring buffer mode, is for temporarily storing the packets to be directly transmitted from the receiver means to the transmitter means, wherein the ring buffering means has a predetermined ring interval.
Claim 4
Independent Claim
252 words
A method for controlling a ring communication network node apparatus including receiver means, ordering buffering means, receiving queuing means, trunk buffering means, transmitting queuing means and transmitter means, the method comprising the steps of: (A) when a node receives a seizure slot transporting a packet, determining a destination node for the packet; (B) when the destination node has been determined in the step (A) to correspond to the node that has received the packet, storing the packet in the ordering buffering means, reading a message of the packet in accordance with an order assigned thereto, erasing the packet, and then executing an empty slot receiving and processing procedure; (C) when the destination node has been determined in the step (A) to correspond to a node other than the node that has received the packet, determining a state of the transmitting queuing means and a state of the trunk buffering means; (D) when at least one of the transmitting queuing means and the trunk buffering means have been determined in the step (C) to be in an empty state, transmitting the received packet depending on the empty state of each of the transmitting queuing means and the trunk buffering means; and (E) when both the transmitting queuing means and the trunk buffering means have been determined in the step (C) to be in a seizure state, determining which of a packet interval, a trunk interval and a transmission interval is most subsequent, and transmitting the received packet depending on which is most subsequent.
Claim 5
Independent Claim
252 words
A method for controlling a ring communication network node apparatus including receiver means, ordering buffering means, receiving queuing means, trunk buffering means, transmitting queuing means and transmitter means, the method comprising the steps of: (A) when a node receives a seizure slot transporting a packet, determining a destination node for the packet; (B) when the destination node has been determined in the step (A) to correspond to the node that has received the packet, storing the packet in the ordering buffering means, reading a message of the packet in accordance with an order assigned thereto, erasing the packet, and then executing an empty slot receiving and processing procedure; (C) when the destination node has been determined in the step (A) to correspond to a node other than the node that has received the packet, determining a state of the transmitting queuing means and a state of the trunk buffering means; (D) when at least one of the transmitting queuing means and the trunk buffering means have been determined in the step (C) to be in an empty state, transmitting the received packet depending on the empty state of each of the transmitting queuing means and the trunk buffering means; and (E) when both the transmitting queuing means and the trunk buffering means have been determined in the step (C) to be in a seizure state, determining which of a packet interval, a trunk interval and a transmission interval is most subsequent, and transmitting the received packet depending on which is most subsequent.
Claim 6
Dependent Claim
201 words
A method in accordance with claim 3, wherein the empty slot receiving and processing procedure in the step (B) comprises the steps of: (a) determining a state of the transmitting queuing means and a state of the trunk buffering means; (b) when both the transmitting queuing means and the trunk buffering means have been determined in the step (a) to be in an empty state, transmitting an empty slot; (c) when only the trunk buffering means has been determined in the step (a) to be in a seizure state, transmitting a packet stored in the trunk buffering means; (d) when only the transmitting queuing means has been determined in the step (a) to be in a seizure state, transmitting a message stored in the transmitting queuing means; and (e) when both the transmitting queuing means and the trunk buffering means have been determined in the step (a) to be in the seizure state, comparing a transmission interval and a trunk interval, and transmitting a packet stored in the trunk buffering means if the trunk interval is subsequent to the transmission interval while transmitting a message stored in the transmitting queuing means if the transmission interval is subsequent to the trunk interval.
Claim 7
Dependent Claim
156 words
A method in accordance with claim 3, wherein the step (D) comprises the steps of: (a) when both the transmitting queuing means and the trunk buffering means are in the empty state, re-transmitting the received packet; (b) when only the transmitting queuing means is in the empty state, comparing a packet interval of the received packet with a trunk interval, and storing the received packet in the trunk buffering means and transmitting a packet stored in the trunk buffering means if the trunk interval is subsequent to the packet interval; and (c) when only the trunk buffering means is in the empty state, comparing the packet interval with a transmission interval, and storing the received packet in the trunk buffering means and transmitting a message stored in the transmitting queuing means if the transmission interval is subsequent to the packet interval while re-transmitting the received packet if the packet interval is subsequent to the transmission interval.
Claim 8
Dependent Claim
126 words
A method in accordance with claim 3, wherein the step (E) comprises the steps of: (a) comparing the packet interval with both the trunk interval and the transmission interval; (b) when the packet interval has been determined in the step (a) to be subsequent to other intervals, re-transmitting the received packet; (c) when the trunk interval has been determined in the step (a) to be subsequent to other intervals, storing the received packet in the trunk buffering means and transmitting a packet stored in the trunk buffering means; and (d) when the transmission interval has been determined in the step (a) to be subsequent to other intervals, storing the received packet in the trunk buffering means and transmitting a message stored in the transmitting queuing means.
Claim 9
Dependent Claim
253 words
A method in accordance with claim 4, wherein the step of transmitting the message stored in the transmitting queuing means comprises the steps of: (a) incrementing a transmission message count and comparing the incremented transmission message count with a maximum transmission message allocation amount; (b) when the transmission message count has been determined in the step (a) to be less than the maximum transmission message allocation amount, formatting the message in the form of a packet with an order number stored in an order number table corresponding to a destination node for the message and the transmission interval, transmitting the packet to a ring by a seizure slot carrying the packet, and executing an increment in order number; and (c) when the transmission message count has been determined in the step (a) not to be less than the maximum transmission message allocation amount, incrementing the transmission interval and setting the transmission message count by zero, checking whether a difference between the transmission and a ring interval has reached a maximum allowable interval, and formatting the message in the form of a packet with the order number stored in an order number table corresponding to the destination node for the message and the transmission interval, transmitting the packet to the ring by the seizure slot carrying the packet and executing an increment in order number if the interval difference has not reached the maximum allowable interval yet, while stopping the transmission of the message if the interval difference has reached the maximum allowable interval.
Claim 10
Dependent Claim
253 words
A method in accordance with claim 5, wherein the step of transmitting the message stored in the transmitting queuing means comprises the steps of: (a) incrementing a transmission message count and comparing the incremented transmission message count with a maximum transmission message allocation amount; (b) when the transmission message count has been determined in the step (a) to be less than the maximum transmission message allocation amount, formatting the message in the form of a packet with an order number stored in an order number table corresponding to a destination node for the message and the transmission interval, transmitting the packet to a ring by a seizure slot carrying the packet, and executing an increment in order number; and (c) when the transmission message count has been determined in the step (a) not to be less than the maximum transmission message allocation amount, incrementing the transmission interval and setting the transmission message count by zero, checking whether a difference between the transmission and a ring interval has reached a maximum allowable interval, and formatting the message in the form of a packet with the order number stored in an order number table corresponding to the destination node for the message and the transmission interval, transmitting the packet to the ring by the seizure slot carrying the packet and executing an increment in order number if the interval difference has not reached the maximum allowable interval yet, while stopping the transmission of the message if the interval difference has reached the maximum allowable interval.
Claim 11
Dependent Claim
253 words
A method in accordance with claim 6, wherein the step of transmitting the message stored in the transmitting queuing means comprises the steps of: (a) incrementing a transmission message count and comparing the incremented transmission message count with a maximum transmission message allocation amount; (b) when the transmission message count has been determined in the step (a) to be less than the maximum transmission message allocation amount, formatting the message in the form of a packet with an order number stored in an order number table corresponding to a destination node for the message and the transmission interval, transmitting the packet to a ring by a seizure slot carrying the packet, and executing an increment in order number; and (c) when the transmission message count has been determined in the step (a) not to be less than the maximum transmission message allocation amount, incrementing the transmission interval and setting the transmission message count by zero, checking whether a difference between the transmission and a ring interval has reached a maximum allowable interval, and formatting the message in the form of a packet with the order number stored in an order number table corresponding to the destination node for the message and the transmission interval, transmitting the packet to the ring by the seizure slot carrying the packet and executing an increment in order number if the interval difference has not reached the maximum allowable interval yet, while stopping the transmission of the message if the interval difference has reached the maximum allowable interval.
References Cited (Backward Citations)
US4561092A
Cited
US4759015A
Cited
US4949336A
Cited
US4926418A
Cited
US5140587A
Cited
US5245605A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-06-11 | 1999-12-11 | 2000-06-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-06-11 | 2003-12-11 | 2004-06-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-06-11 | 2007-12-11 | 2008-06-11 | $7700.00 | Window Closed / Lapsed |