US5936940A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive rate-based congestion control in packet networks
Assignee: International Business Machines Corp
•
Filing: 1996-08-22
•
Granted: 1999-08-10
•
Expires: 2016-08-22
Abstract
Abstract An enhanced adaptive rate-based congestion control system for packet transmission networks uses the absolute rather than the relative network queuing delay measure of congestion in the network. Other features of the congestion control system include test transmissions only after a predetermined minimum time, after the receipt of an acknowledgment from the previous test, or transmission of a minimum data burst, whichever takes longest. The congestion control system also provides a small reduction in rate at low rates and a large reduction in rates at high rates. A logarithmic rate control function provides this capability. Rate damping is provided by changing all of the values in a rate look-up tables in response to excessive rate variations. Finally, the fair share of the available bandwidth is used as the starting point for rates at start-up or when a predefined rate damping region is exited.
Inventors
- 👤 Gerald Arnold Marin
- 👤 Lap T. Huynh
- 👤 Ken Van Vu
- 👤 Raif O. Onvural
- 👤 Levent Gun
- 👤 Bouchung Lin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 13:23
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L12/5602; H04L2012/5619; H04L2012/5629; H04L2012/5631; H04L2012/5636
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
192 words
A packet transmission network comprising a plurality of transmission nodes interconnected by transmission links, a plurality of user applications for transmitting data streams on said network, said data streams including data streams requiring reserved data paths of predefined levels of service quality and data streams requiring best efforts transmission paths, means for selecting reserved data paths through said network between pairs of said user applications wherein said reserved data paths have said guaranteed pre-defined levels of service quality, means for transmitting best efforts data on said best efforts transmission paths during those times when said reserved data paths are partially idle, means for controlling the access of said best efforts data to said network in order to prevent interference with data on said reserved data paths, said means for controlling the access of said best efforts data comprising means for detecting the level of congestion in said network, table driven means for controlling the rate of said best efforts data in response to said level of congestion, and means for multiplicatively changing the values in said table driven means in response to excessive changes in said rate of said best efforts data.
Claim 2
Dependent Claim
192 words
A packet transmission network comprising a plurality of transmission nodes interconnected by transmission links, a plurality of user applications for transmitting data streams on said network, said data streams including data streams requiring reserved data paths of predefined levels of service quality and data streams requiring best efforts transmission paths, means for selecting reserved data paths through said network between pairs of said user applications wherein said reserved data paths have said guaranteed pre-defined levels of service quality, means for transmitting best efforts data on said best efforts transmission paths during those times when said reserved data paths are partially idle, means for controlling the access of said best efforts data to said network in order to prevent interference with data on said reserved data paths, said means for controlling the access of said best efforts data comprising means for detecting the level of congestion in said network, table driven means for controlling the rate of said best efforts data in response to said level of congestion, and means for multiplicatively changing the values in said table driven means in response to excessive changes in said rate of said best efforts data.
Claim 3
Dependent Claim
31 words
The packet transmission network according to claim 1 wherein said means for detecting congestion in said network comprises means for estimating the absolute value of the queuing delay in said network.
Claim 4
Dependent Claim
23 words
The packet transmission network according to claim 1 further comprising means for inserting a spacer between successive cells of said best efforts data.
Claim 5
Dependent Claim
35 words
The packet transmission network according to claim 3 wherein said spacer length is responsive to a time-out function, an acknowledgment, or the transmission of a minimum burst of said best efforts traffic, whichever occurs first.
Claim 6
Dependent Claim
73 words
The packet transmission network according to claim 1 wherein said means for determining the congestion in said network comprises means for transmitting a series of test samples through said network each having a time stamp containing the time of launch, means for comparing successive test samples to determine total delay through said network, and means for determining the minimum value of said total delay through said network for the duration of a connection.
Claim 7
Dependent Claim
65 words
The packet transmission network according to claim 1 further comprising means for reducing said rate of said best efforts data by a first value when said rate is less than a predetermined value, and means for reducing said rate of said best efforts data by a second value greater than said first value when said rate is at a higher value than said predetermined value.
Claim 8
Dependent Claim
33 words
The packet transmission network according to claim 1 further comprising means for initializing said rate of said best efforts data at the fair share value of the currently available bandwidth in said network.
Claim 9
Independent Claim
198 words
A method for transmitting maximum data on a packet transmission network comprising the steps of interconnecting a plurality of transmission nodes by transmission links, transmitting data streams from a plurality of user applications on said network, said data streams including reserved path data streams requiring guaranteed levels of transmission quality and best efforts data streams requiring only the best efforts available levels of transmission quality, selecting reserved data paths through said network between pairs of said user applications wherein said reserved data paths have said guaranteed levels of service quality, transmitting best efforts data on said network during those times when said reserved data paths are partially idle, controlling the access of said best efforts data to said network in order to prevent interference with data on said reserved data paths, said step of controlling the access of said best efforts data comprising the steps of detecting the level of congestion in said network, controlling by means of a look-up table the rate of said best efforts data in response to said level of congestion, and multiplicatively changing the values in said table driven means in response to excessive changes in said rate of said best efforts data.
Claim 10
Independent Claim
198 words
A method for transmitting maximum data on a packet transmission network comprising the steps of interconnecting a plurality of transmission nodes by transmission links, transmitting data streams from a plurality of user applications on said network, said data streams including reserved path data streams requiring guaranteed levels of transmission quality and best efforts data streams requiring only the best efforts available levels of transmission quality, selecting reserved data paths through said network between pairs of said user applications wherein said reserved data paths have said guaranteed levels of service quality, transmitting best efforts data on said network during those times when said reserved data paths are partially idle, controlling the access of said best efforts data to said network in order to prevent interference with data on said reserved data paths, said step of controlling the access of said best efforts data comprising the steps of detecting the level of congestion in said network, controlling by means of a look-up table the rate of said best efforts data in response to said level of congestion, and multiplicatively changing the values in said table driven means in response to excessive changes in said rate of said best efforts data.
Claim 11
Dependent Claim
30 words
The method according to claim 8 wherein said step of detecting congestion in said network comprises the steps of estimating the absolute value of the queuing delay in said network.
Claim 12
Dependent Claim
22 words
The method according to claim 8 further comprising the step of inserting a spacer between successive cells of said best efforts data.
Claim 13
Dependent Claim
46 words
The method according to claim 10 wherein said step of inserting a spacer comprises the step of selecting said spacer length in response to a time-out function, to an acknowledgment, or to the transmission of a minimum burst of said best efforts traffic, whichever occurs first.
Claim 14
Dependent Claim
68 words
The method according to claim 8 wherein said step of determining the congestion in said network comprises the steps of transmitting a series of test samples through said network each having a time stamp containing the time of launch, comparing successive test samples to determine total delay through said network, and determining the minimum value of said total delay through said network during the duration of a connection.
Claim 15
Dependent Claim
63 words
The method according to claim 8, further comprising the steps of reducing said rate of said best efforts data by a first smaller value when said rate is less than a predetermined value, and reducing said rate of said best efforts data by a second value greater than said first value when said rate is at a higher value than said predetermined value.
Claim 16
Dependent Claim
32 words
The method according to claim 8 further comprising the step of initializing said rate of said best efforts data at the fair share value of the currently available bandwidth in said network.
Claim 17
Dependent Claim
130 words
A packet network access system having an instantaneously variable available transmission capacity at any time, said access system comprising means for detecting the level of congestion in said network, means for controlling the rate of data transmission into said network in response to said level of congestion, means for initializing said rate of data transmission into said network at a fair share of the transmission capacity available on said network at the time of initialization, means for reducing said rate of transmission by a first smaller value when said rate of transmission is less than a predetermined value, and means for reducing said rate of of transmission by a second value greater than said first value when said rate of transmission is at a higher value than said predetermined value.
Claim 18
Dependent Claim
130 words
A packet network access system having an instantaneously variable available transmission capacity at any time, said access system comprising means for detecting the level of congestion in said network, means for controlling the rate of data transmission into said network in response to said level of congestion, means for initializing said rate of data transmission into said network at a fair share of the transmission capacity available on said network at the time of initialization, means for reducing said rate of transmission by a first smaller value when said rate of transmission is less than a predetermined value, and means for reducing said rate of of transmission by a second value greater than said first value when said rate of transmission is at a higher value than said predetermined value.
Claim 19
Dependent Claim
127 words
A packet network access method for a packet network having an instantaneously variable available transmission capacity at any time, said access method comprising the steps of detecting the level of congestion in said network by transmitting a series of test samples through said network each having a time stamp containing the time of launch, and comparing successive test samples to determine total delay through said network, and determining the minimum value of said total delay through said network for the duration of a connection, controlling the rate of data transmission into said network in response to said level of congestion, and initializing said rate of data transmission into said network at a fair share of the transmission capacity available on said network at the time of initialization.
Claim 20
Dependent Claim
127 words
A packet network access method for a packet network having an instantaneously variable available transmission capacity at any time, said access method comprising the steps of detecting the level of congestion in said network by transmitting a series of test samples through said network each having a time stamp containing the time of launch, and comparing successive test samples to determine total delay through said network, and determining the minimum value of said total delay through said network for the duration of a connection, controlling the rate of data transmission into said network in response to said level of congestion, and initializing said rate of data transmission into said network at a fair share of the transmission capacity available on said network at the time of initialization.
Claim 21
Dependent Claim
64 words
The packet network access method according to claim 16 further comprising the steps of reducing said rate of transmission by a first smaller value when said rate of transmission is less than a predetermined value, and reducing said rate of transmission by a second value greater than said first value when said rate of transmission is at a higher value than said predetermined value.
References Cited (Backward Citations)
US5377327A
Cited
US5367523A
Cited
US5719853A
Cited
US5675576A
Cited
US5754530A
Cited
US5748901A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-09 | 2003-02-08 | 2003-08-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-09 | 2007-02-08 | 2007-08-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-09 | 2011-02-08 | 2011-08-10 | $7700.00 | Window Closed / Lapsed |