US6122254A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for network flow control with perceptive parameters
Assignee: International Business Machines Corp
•
Filing: 1997-11-25
•
Granted: 2000-09-19
•
Expires: 2017-11-25
Abstract
Abstract A method and apparatus for flow control for sources in packet switched networks is implemented. A data rate for the source is determined based on a critically damped second-order system in response to a congestion signal sent by a destination node or other network device. The data rate is damped toward a share value that is also based on a critically damped second-order system. The resulting flow control reduces packet loss and improves network utilization.
Inventors
- 👤 Metin Aydemir
- 👤 Clark Debs Jeffries
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 14:23
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/26; H04L47/263; H04L47/18
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
71 words
In a data processing network, a method of data flow control between nodes in the network comprising the steps of: determining a share of network capacity that a data source should have according to a critically damped second-order system; and determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 2
Dependent Claim
71 words
In a data processing network, a method of data flow control between nodes in the network comprising the steps of: determining a share of network capacity that a data source should have according to a critically damped second-order system; and determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 3
Dependent Claim
57 words
The method of claim 1 wherein said source node data rate r i (t+Δt) is calculated from: r.sub.i (t+Δt)=max{0, 2r.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 r.sub.i (t-Δt)-2k.sub.r [r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates network congestion, wherein k, is a damping constant, and wherein said network congestion signal is provided from a network device to said source node.
Claim 4
Dependent Claim
40 words
The method of claim 2 wherein said share S(t+Δt) is calculated from: S(t-Δt)=max{0, 2S)(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)+f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k s is a damping constant, and f 1 is a preselected constant.
Claim 5
Dependent Claim
34 words
The method of claim 3 wherein said damping rate, k r , is in the range from 0 to 1, and said damping rate, k s is in the range from 0 to 1.
Claim 6
Dependent Claim
19 words
The method of claim 3 wherein said f 1 is equal to a maximum link rate in the network.
Claim 7
Dependent Claim
58 words
The method of claim 1 wherein said source node data rate r i (t+Δt) is calculated from: r.sub.i (t-Δt)=max{0, 2.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 [r.sub.i (t-Δt)-S(t)]-2k.sub.r [r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates no network congestion, wherein k r is a damping constant, and said network congestion signal is provided from a network device to said source node.
Claim 8
Dependent Claim
42 words
The method of claim 5 wherein said share S(t+Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.2 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k s is a damping constant, and f 2 is a preselected target share value.
Claim 9
Dependent Claim
34 words
The method of claim 7 wherein said damping rate, k s , is in the range from 0 to 1, and said damping rate, k s is in the range from 0 to 1.
Claim 10
Dependent Claim
19 words
The method of claim 7 wherein said f 2 is equal to a maximum link rate in the network.
Claim 11
Dependent Claim
53 words
The method of claim 1 wherein said share S(t+Δt) is calculated from: S(t-Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k s is a damping constant, f 1 is a preselected constant, and said network congestion signal is provided from a network device to said source node.
Claim 12
Dependent Claim
61 words
The method of claim 1 wherein said share S(t-Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.2 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k r is a damping constant, and f 2 is a preselected constant representing a target share value, and wherein said network congestion signal is provided from a network device to said source node.
Claim 13
Dependent Claim
82 words
In a data processing network, a data processing system for data flow control between nodes in the network comprising: circuitry for determining a share of network capacity that a data source should have according to a critically damped second-order system; and circuitry coupled and responsive to said share determine circuitry for determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 14
Dependent Claim
82 words
In a data processing network, a data processing system for data flow control between nodes in the network comprising: circuitry for determining a share of network capacity that a data source should have according to a critically damped second-order system; and circuitry coupled and responsive to said share determine circuitry for determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 15
Dependent Claim
58 words
The data processing system of claim 12 wherein said source data rate r i (t-Δt) is calculated from: r.sub.i (t-Δt)=max{0, 2r.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 r.sub.i (t-Δt)-2k.sub.r [r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates network congestion, wherein k r is a damping constant, and said network congestion signal is provided from a network device to said source node.
Claim 16
Dependent Claim
41 words
The data processing system of claim 13 wherein said share S(t+Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k s is a damping constant and f 1 is a preselected constant.
Claim 17
Dependent Claim
19 words
The data processing system of claim 14 wherein said f 1 is equal to a maximum network link rate.
Claim 18
Dependent Claim
60 words
The data processing system of claim 12 wherein said source node data rate is r i (t+Δt) calculated from: r.sub.i (t-Δt)=max{0, 2r.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 [r.sub.i (t-Δt)-S(t)]-2k.sub.r [r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates no network congestion, wherein k r is a damping constant, and said network congestion signal is provided from a network device to said source node.
Claim 19
Dependent Claim
44 words
The data processing system of claim 16 wherein said share S(t+Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-s(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.2 ]-2k.sub.s [S(t)-s(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k s is a damping constant, and f 2 is a preselected target share value.
Claim 20
Dependent Claim
19 words
The data processing system of claim 17 wherein said f 2 is equal to a maximum network link rate.
Claim 21
Dependent Claim
56 words
The data processing system of claim 12 wherein said share S(t+Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)+f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k 2 is a damping constant and f 1 is a preselected constant, and said network congestion signal is provided from a network device to said source node.
Claim 22
Dependent Claim
58 words
The data processing system of claim 12 wherein said share S(t+Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.2 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k s is a damping constant, f 2 is a preselected target share value, and said network congestion signal is provided from a network device to said source node.
Claim 23
Dependent Claim
88 words
A program product adaptable for storage on a storage media, said program product operable for determining data flow control from a source node to a destination node within a data processing network comprising: programming for determining a share of network capacity that a data source should have according to a critically damped second-order system; and programming for determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 24
Dependent Claim
88 words
A program product adaptable for storage on a storage media, said program product operable for determining data flow control from a source node to a destination node within a data processing network comprising: programming for determining a share of network capacity that a data source should have according to a critically damped second-order system; and programming for determining a source node data rate using said share when a network congestion signal indicates no congestion, said source node data rate representing a data sending rate of a source node.
Claim 25
Dependent Claim
62 words
The program product adaptable for storage on a storage media of claim 21 wherein said source node data rate is calculated from: r.sub.i (t+Δt)=max{0, 2r.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 r.sub.i (t-Δt)-2k.sub.r [r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates network congestion, wherein k r is a damping constant, and said network congestion signal is provided from a network device to said source node.
Claim 26
Dependent Claim
47 words
The program product adaptable for storage on a storage media of claim 22 wherein said share S(t+Δt) is calculated from: S(t-Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)-f.sub.1 ]-2k.sub.s[S (t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k s is a damping constant, and f 1 is a preselected constant.
Claim 27
Dependent Claim
27 words
The program product available for storage on a storage media of claim 23 wherein said f 1 is equal to a maximum link rate in the network.
Claim 28
Dependent Claim
67 words
The program product adaptable for storage on a storage media of claim 21 wherein said source node data rate r i (t+Δt) is calculated from: r.sub.i (t+Δt)=max{0, 2r.sub.i (t)-r.sub.i (t)-r.sub.i (t-Δt)-k.sub.r.sup.2 [r.sub.i (t-Δt)-S(t)]-2k.sub.r ]r.sub.i (t)-r.sub.i (t-Δt)]} when said network congestion signal indicates no network congestion, wherein k r is a damping constant, and said network congestion signal is provided from a network device to said source node.
Claim 29
Dependent Claim
50 words
The program product adaptable for storage on a storage media of claim 25 wherein said share S(t-Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S)(t-Δt)-k.sub.s.sup.2 [S(t-Δt)+f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k s is a damping constant and f 2 is a preselected target share value.
Claim 30
Dependent Claim
27 words
The program product adaptable for storage on a storage media of claim 26 wherein said f 2 is equal to a maximum link rate in the network.
Claim 31
Dependent Claim
61 words
The program product adaptable for storage on a storage media of claim 21 wherein said share S(t-Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)+f.sub.1 ]-2k.sub.s [S(t)-S(t-Δt)]} when said network congestion signal indicates network congestion, wherein k s is a damping constant, f 1 is a preselected constant, and said network congestion signal is provided from a network device to said source node.
Claim 32
Dependent Claim
64 words
The program product adaptable for storage on a storage media of claim 21 wherein said share S(t-Δt) is calculated from: S(t+Δt)=max{0, 2S(t)-S(t-Δt)-k.sub.s.sup.2 [S(t-Δt)+f.sub.1 ]-2k.sub.s S(t)-S(t-Δt)]} when said network congestion signal indicates no network congestion, wherein k s is a damping constant, f 2 is a preselected target share value, and said network congestion signal is provided from a network device to said source node.
References Cited (Backward Citations)
US5142570A
Cited
US5852601A
Cited
US5313454A
Cited
US5359593A
Cited
US5434848A
Cited
US5675576A
Cited
US5940372A
Cited
US5812527A
Cited
US5936940A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-09-19 | 2004-03-20 | 2004-09-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-09-19 | 2008-03-20 | 2008-09-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-09-19 | 2012-03-20 | 2012-09-19 | $7700.00 | Window Closed / Lapsed |