Patent US5048013A successfully refreshed from Google Patents.
US5048013A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Transmission congestion control method and apparatus
Assignee: Nokia Bell Labs
•
Filing: 1990-04-06
•
Granted: 1991-09-10
•
Expires: 2010-04-06
Abstract
Abstract A congestion control method and apparatus for use with a communications link comprising a plurality of N channels. A plurality of at most N-1 queues are sequentially polled, and data is output therefrom to the communications link, thereby leaving at least one remaining channel. After the at most N-1 queues are polled, a determination is made as to which of the at most N-1 queues is closest to a data overflow condition. The remaining at least one channel is then utilized to transmit data from the queues which are closest to overflow.
Inventors
- 👤 Kai Y. Eng
- 👤 Richard D. Gitlin
- 👤 Mark J. Karol
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:29
CPC Classifications
H; H04; H04J; H04J3/00; H04J3/24; H04J3/247; H04J3/16; H04J3/1682
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
114 words
In an apparatus for generating a plurality of N communications channels, and including a plurality of at most N-1 queues, a method of controlling transmission congestion comprising the steps of: (a) polling one of the queues, and transmitting data therefrom on an associated separate one of the N channels during such time when the queue is polled; (b) repeating step (a) for each of the plurality of at most N-1 queues, thereby leaving at least one remaining channel; (c) determining at least one queue which has the most data stored therein relative to the other queues and outputting data therefrom on said at least one remaining channel; and (d) repeating steps (a) through (c).
Claim 2
Dependent Claim
114 words
In an apparatus for generating a plurality of N communications channels, and including a plurality of at most N-1 queues, a method of controlling transmission congestion comprising the steps of: (a) polling one of the queues, and transmitting data therefrom on an associated separate one of the N channels during such time when the queue is polled; (b) repeating step (a) for each of the plurality of at most N-1 queues, thereby leaving at least one remaining channel; (c) determining at least one queue which has the most data stored therein relative to the other queues and outputting data therefrom on said at least one remaining channel; and (d) repeating steps (a) through (c).
Claim 3
Dependent Claim
15 words
The method of claim 1 wherein the communications link is a fiber optic communications link.
Claim 4
Dependent Claim
67 words
The method of claim 1 wherein the step (c) of determining and outputting comprises: monitoring a fullness associated with each queue; recording an address associated with a queue which is most full; generating a control signal in response to the recorded address; transmitting the control signal to a switch; and switching data from the queue associated with the recorded address to the communications link via the switch.
Claim 5
Dependent Claim
146 words
Apparatus for generating a plurality of N communications channels, the apparatus being adapted for connection to a communications link, comprising: a plurality of at most N-1 queues; means for sequentially polling said queues and for outputting data from each queue on an associated separate one of said N communications channels during such time when said queue is polled, thereby leaving at least one remaining communications channel; means for monitoring each of said queues to determine at least one of said queues which has the most data stored therein relative to the other queues; and means for switching data from said at least one queue which has the most data stored therein to said means for sequentially polling and for outputting, thereby causing data from said at least one queue which has the most data stored therein to be output on said at least one remaining channel.
Claim 6
Dependent Claim
146 words
Apparatus for generating a plurality of N communications channels, the apparatus being adapted for connection to a communications link, comprising: a plurality of at most N-1 queues; means for sequentially polling said queues and for outputting data from each queue on an associated separate one of said N communications channels during such time when said queue is polled, thereby leaving at least one remaining communications channel; means for monitoring each of said queues to determine at least one of said queues which has the most data stored therein relative to the other queues; and means for switching data from said at least one queue which has the most data stored therein to said means for sequentially polling and for outputting, thereby causing data from said at least one queue which has the most data stored therein to be output on said at least one remaining channel.
Claim 7
Dependent Claim
15 words
The apparatus of claim 4 wherein said communications link is a fiber optic communications link.
Claim 8
Dependent Claim
33 words
The apparatus of claim 4 wherein the means for monitoring includes means for monitoring a fullness associated with each queue, and for recording an address associated with a queue which is most full.
Claim 9
Dependent Claim
39 words
The apparatus of claim 6 wherein the means for sequentially polling comprises a Time Division Multiplexer, the Time Division Multiplexer including a plurality of outputs, each output arranged to receive data from a separate one of the N-1 queues.
Claim 10
Dependent Claim
33 words
The apparatus of claim 5 wherein the means for monitoring includes means for monitoring a fullness associated with each queue, and for recording an address associated with a queue which is most full.
Claim 11
Dependent Claim
39 words
The apparatus of claim 8 wherein the means for sequentially polling comprises a Time Division Multiplexer, the Time Division Multiplexer including a plurality of outputs, each output arranged to receive data from a separate one of the N-1 queues.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-09 | 1995-03-11 | 1995-09-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-09 | 1999-03-11 | 1999-09-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-09 | 2003-03-11 | 2003-09-10 | $7700.00 | Window Closed / Lapsed |