Patent US5359592A successfully refreshed from Google Patents.
US5359592A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bandwidth and congestion control for queue channels in a cell switching communication controller
Assignee: Cisco Technology Inc
•
Filing: 1993-06-25
•
Granted: 1994-10-25
•
Expires: 2013-06-25
Abstract
Abstract A mechanism for buffering communication cells in a communication controller, wherein a cell queuing circuit provides a cell loss priority mechanism, and wherein the cell queuing circuit determines service states for queue channels according to bandwidth allocation parameters. The service states includes a serve -- now state, a serve -- ok state, and a no -- serve state, such that a queue channel is in the serve -- now state if the queue channel must be serviced to maintain a minimum information rate parameter for the queue channel, the serve -- ok state if the queue channel can be serviced and not exceed a peak information rate parameter for the queue channel.
Inventors
- 👤 Charles M. Corbalis
- 👤 Ross S. Heitkamp
- 👤 Rafael Gomez
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 19:43
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/50; H04L49/501; H04L49/20; H04L49/205; H04L49/505; H04L49/506; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5629; H04L2012/5631; H04L2012/5632; H04L2012/5635; H04L2012/5638; H04L2012/5646; H04L2012/5651; H04L2012/5678; H04L2012/5681; H04L49/25; H04L49/253; H04L49/254; H04L49/30
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
219 words
A method for buffering communication cells in a plurality of queue channels in a communication controller, comprising the steps of: receiving a first communication cell over a first communication link, the first communication cell specifying a destination queue channel from among a plurality of queue channels, the first communication cell comprising a cell loss priority status; if the cell loss priority status is in a first state and if a depth of a destination cell queue corresponding to the destination queue channel exceeds a cell loss priority threshold for the destination queue channel, then discarding the first communication cell; if the cell loss priority status is not in the first state or if the depth of the destination cell queue corresponding to the destination queue channel does not exceed the cell loss priority threshold, then entering the communication cell into the destination cell queue; updating a set of queue service control parameters for each queue channel in a service chain while determining a next serviced queue channel in the service chain according to the queue service control parameters, the queue service control parameters specifying bandwidth allocation on a second communication link; accessing a second communication cell from a serviced cell queue specified by the next serviced queue channel, and transferring the second communication cell over the second communication link.
Claim 2
Independent Claim
219 words
A method for buffering communication cells in a plurality of queue channels in a communication controller, comprising the steps of: receiving a first communication cell over a first communication link, the first communication cell specifying a destination queue channel from among a plurality of queue channels, the first communication cell comprising a cell loss priority status; if the cell loss priority status is in a first state and if a depth of a destination cell queue corresponding to the destination queue channel exceeds a cell loss priority threshold for the destination queue channel, then discarding the first communication cell; if the cell loss priority status is not in the first state or if the depth of the destination cell queue corresponding to the destination queue channel does not exceed the cell loss priority threshold, then entering the communication cell into the destination cell queue; updating a set of queue service control parameters for each queue channel in a service chain while determining a next serviced queue channel in the service chain according to the queue service control parameters, the queue service control parameters specifying bandwidth allocation on a second communication link; accessing a second communication cell from a serviced cell queue specified by the next serviced queue channel, and transferring the second communication cell over the second communication link.
Claim 3
Dependent Claim
25 words
The method of claim 1, wherein for each queue channel the queue service control parameters comprise a minimum information rate and a peak information rate.
Claim 4
Dependent Claim
54 words
The method of claim 2, wherein the step of updating a set of queue service control parameters for each queue channel further comprises the step of determining a service state for each queue channel, the service state comprising a serve -- now state, a serve -- ok state, and a no -- serve state.
Claim 5
Dependent Claim
33 words
The method of claim 3, wherein each queue channel is in the serve -- now state if the queue channel must be serviced to maintain the minimum information rate for the queue channel.
Claim 6
Dependent Claim
34 words
The method of claim 3, wherein each queue channel is in the serve -- ok state if the queue channel can be serviced and not exceed the peak information rate for the queue channel.
Claim 7
Dependent Claim
34 words
The method of claim 3, wherein each queue channel is in the no -- serve state if the queue channel does not require service to maintain the minimum information rate for the queue channel.
Claim 8
Dependent Claim
27 words
The method of claim 3, wherein each queue channel is in the no -- serve state if a cell queue corresponding to the queue channel is empty.
Claim 9
Dependent Claim
38 words
The method of claim 3, wherein each queue channel is in the serve -- ok state if a depth of a cell queue corresponding to the queue channel exceeds a cell loss priority threshold for the queue channel.
Claim 10
Dependent Claim
153 words
The method of claim 3, wherein for each queue channel the step of updating a set of queue service control parameters, comprises the steps of: adding a minimum information rate count to a minimum information rate increment value, the minimum information rate count and the minimum information rate increment value comprising the minimum information rate for the queue channel; if the addition of the minimum information rate count and the minimum information rate increment value generates an overflow, then setting a minimum information rate credit for the queue channel; adding a peak information rate count to a peak information rate increment value, the peak information rate count and the peak information rate increment value comprising the peak information rate for the queue channel; if the addition of the peak information rate count and the peak information rate increment value generates the overflow, then setting a peak information rate credit for the queue channel.
Claim 11
Dependent Claim
94 words
The method of claim 9, wherein for each queue channel the step of determining a service state, comprises the steps of: setting the service state to the serve -- now state if the minimum information rate credit is set; setting the service state to the serve -- ok state if the maximum information rate credit set and the minimum information rate credit is not set; setting the service state to the no -- serve state if the maximum information rate credit is not set and if the minimum information rate credit is not set.
Claim 12
Dependent Claim
90 words
The method of claim 9 wherein for each queue channel the step of determining a service state, comprises the steps of: setting the service state to the serve -- now state if a force minimum credit flag of the queue service control parameters is set; setting the service state to the serve -- ok state if a force maximum credit flag of the queue service control parameters is set; setting the service state to the no -- serve state if a cell queue corresponding to the queue channel is empty.
Claim 13
Dependent Claim
61 words
The method of claim 3, wherein the step of determining a next serviced queue channel in the service chain, comprises the step of searching the service chain in a predefined order specified by the queue service control parameters and selecting the next serviced queue channel as a first queue channel in the service chain found in the serve -- now state.
Claim 14
Dependent Claim
83 words
The method of claim 3, wherein the step of determining a next serviced queue channel in the service chain, comprises the step of searching the service chain in a predefined order specified by the queue service control parameters and selecting the next serviced queue channel as a first queue channel found in the serve -- ok state in the service chain after a last serve ok queue channel if no queue channel in the service chain is in the serve -- now state.
Claim 15
Dependent Claim
35 words
The method of claim 1, further comprising the step of setting an explicit forward notification status in the second communication cell if a depth of the serviced cell queue exceeds an explicit forward notification threshold.
Claim 16
Independent Claim
224 words
An apparatus for buffering communication cells in a plurality of queue channels in a communication controller, comprising: circuit for receiving a first communication cell over a first communication link, the first communication cell specifying a destination queue channel from among a plurality of queue channels, the first communication cell comprising a cell loss priority status; circuit for discarding the first communication cell if the cell loss priority status is in a first state and if a depth of a destination cell queue corresponding to the destination queue channel exceeds a cell loss priority threshold for the destination queue channel; circuit for entering the communication cell into the destination cell queue if the cell loss priority status is not in the first state or if the depth of the destination cell queue corresponding to the destination queue channel does not exceed the cell loss priority threshold; circuit for updating a set of queue service control parameters for each queue channel in a service chain while determining a next serviced queue channel in the service chain according to the queue service control parameters, the queue service control parameters specifying bandwidth allocation on a second communication link; circuit for accessing a second communication cell from a serviced cell queue specified by the next serviced queue channel, and transferring the second communication cell over the second communication link.
Claim 17
Independent Claim
224 words
An apparatus for buffering communication cells in a plurality of queue channels in a communication controller, comprising: circuit for receiving a first communication cell over a first communication link, the first communication cell specifying a destination queue channel from among a plurality of queue channels, the first communication cell comprising a cell loss priority status; circuit for discarding the first communication cell if the cell loss priority status is in a first state and if a depth of a destination cell queue corresponding to the destination queue channel exceeds a cell loss priority threshold for the destination queue channel; circuit for entering the communication cell into the destination cell queue if the cell loss priority status is not in the first state or if the depth of the destination cell queue corresponding to the destination queue channel does not exceed the cell loss priority threshold; circuit for updating a set of queue service control parameters for each queue channel in a service chain while determining a next serviced queue channel in the service chain according to the queue service control parameters, the queue service control parameters specifying bandwidth allocation on a second communication link; circuit for accessing a second communication cell from a serviced cell queue specified by the next serviced queue channel, and transferring the second communication cell over the second communication link.
Claim 18
Dependent Claim
25 words
The apparatus of claim 15, wherein for each queue channel the queue service control parameters comprise a minimum information rate and a peak information rate.
Claim 19
Dependent Claim
53 words
The apparatus of claim 16, wherein the circuit for updating a set of queue service control parameters for each queue channel further comprises circuit for determining a service state for each queue channel, the service state comprising a serve -- now state, a serve -- ok state, and a no -- serve state.
Claim 20
Dependent Claim
33 words
The apparatus of claim 17, wherein each queue channel is in the serve -- now state if the queue channel must be serviced to maintain the minimum information rate for the queue channel.
Claim 21
Dependent Claim
34 words
The apparatus of claim 17, wherein each queue channel is in the serve -- ok state if the queue channel can be serviced and not exceed the peak information rate for the queue channel.
Claim 22
Dependent Claim
34 words
The apparatus of claim 17, wherein each queue channel is in the no -- serve state if the queue channel does not require service to maintain the minimum information rate for the queue channel.
Claim 23
Dependent Claim
27 words
The apparatus of claim 17, wherein each queue channel is in the no -- serve state if a cell queue corresponding to the queue channel is empty.
Claim 24
Dependent Claim
38 words
The apparatus of claim 17, wherein each queue channel is in the serve -- ok state if a depth of a cell queue corresponding to the queue channel exceeds a cell loss priority threshold for the queue channel.
Claim 25
Dependent Claim
156 words
The apparatus of claim 17, wherein for each queue channel the circuit for updating a set of queue service control parameters, comprises: circuit for adding a minimum information rate count to a minimum information rate increment value, the minimum information rate count and the minimum information rate increment value comprising the minimum information rate for the queue channel; circuit for setting a minimum information rate credit for the queue channel if the addition of the minimum information rate count and the minimum information rate increment value generates an overflow; circuit for adding a peak information rate count to a peak information rate increment value, the peak information rate count and the peak information rate increment value comprising the peak information rate for the queue channel; circuit for setting a peak information rate credit for the queue channel if the addition of the peak information rate count and the peak information rate increment value generates the overflow.
Claim 26
Dependent Claim
97 words
The apparatus of claim 23, wherein for each queue channel the circuit for determining a service state, comprises: circuit for setting the service state to the serve -- now state if the minimum information rate credit is set; circuit for setting the service state to the serve -- ok state if the maximum information rate credit set and the minimum information rate credit is not set; circuit for setting the service state to the no -- serve state if the maximum information rate credit is not set and if the minimum information rate credit is not set.
Claim 27
Dependent Claim
93 words
The apparatus of claim 23, wherein for each queue channel the circuit for determining a service state, comprises: circuit for setting the service state to the serve -- now state if a force minimum credit flag of the queue service control parameters is set; circuit for setting the service state to the serve -- ok state if a force maximum credit flag of the queue service control parameters is set; circuit for setting the service state to the no -- serve state if a cell queue corresponding to the queue channel is empty.
Claim 28
Dependent Claim
60 words
The apparatus of claim 17, wherein the circuit for determining a next serviced queue channel in the service chain, comprises circuit for searching the service chain in a predefined order specified by the queue service control parameters and selecting the next serviced queue channel as a first queue channel in the service chain found in the serve -- now state.
Claim 29
Dependent Claim
82 words
The apparatus of claim 17, wherein the circuit for determining a next serviced queue channel in the service chain, comprises circuit for searching the service chain in a predefined order specified by the queue service control parameters and selecting the next serviced queue channel as a first queue channel found in the serve -- ok state in the service chain after a last serve ok queue channel if no queue channel in the service chain is in the serve -- now state.
Claim 30
Dependent Claim
34 words
The apparatus of claim 15, further comprising circuit for setting an explicit forward notification status in the second communication cell if a depth of the serviced cell queue exceeds an explicit forward notification threshold.
References Cited (Backward Citations)
US5119367A
Cited
US5062106A
Cited
US5278830A
Cited
US5130978A
Cited
US5280483A
Cited
US5267232A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-10-24 | 1998-04-25 | 1998-10-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-10-24 | 2002-04-25 | 2002-10-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-10-24 | 2006-04-25 | 2006-10-25 | $7700.00 | Window Closed / Lapsed |