Patent US5319638A successfully refreshed from Google Patents.
US5319638A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Link-by-link congestion control for packet transmission systems
Assignee: Nytell Software LLC
•
Filing: 1991-09-12
•
Granted: 1994-06-07
•
Expires: 2011-09-12
Abstract
Abstract A packet transmission system includes a mechanism for controling congestion (30, FIG. 2) in the transmission system by comparing, at each switching node of the system (52, FIG. 5), the traffic load at that node and the traffic loads at all immediately neighboring switching nodes. Such traffic loads can be measured by node buffer utilization, either discretely or continuously, and loading information exchanged by the use of messages between the switching nodes (42, 54). The packet transmission speed between any two adjacent switching nodes is then adjusted (47, 62) in response to the relative traffic loads so as to reduce the traffic incoming to the more congested node. The transmission speed is never reduced to zero, however, to insure that a mechanism remains in place to relieve congestion at every transmitting switching node.
Inventors
- 👤 Huai-An Lin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 04:33
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
68 words
A packet transmission system comprising a plurality of packet switching nodes interconnected by transmission links between pairs of switching nodes, monitoring means at each of said nodes for monitoring the traffic intended for each other of said nodes, and adjusting means at each of said nodes responsive to said monitoring means at two adjacent nodes for adjusting the transmission rate for packets transmitted between said two adjacent nodes.
Claim 2
Dependent Claim
68 words
A packet transmission system comprising a plurality of packet switching nodes interconnected by transmission links between pairs of switching nodes, monitoring means at each of said nodes for monitoring the traffic intended for each other of said nodes, and adjusting means at each of said nodes responsive to said monitoring means at two adjacent nodes for adjusting the transmission rate for packets transmitted between said two adjacent nodes.
Claim 3
Dependent Claim
52 words
The packet transmission system according to claim 1 further comprising buffering means at each of said switching nodes for buffering data packets intended for transmission to each neighboring switching node connected by one of said transmission links, said monitoring means comprising means for measuring the buffer utilization factor for said buffering means.
Claim 4
Dependent Claim
40 words
The packet transmission system according to claim 2 further comprising means for reporting the crossing of any one of a plurality of preselected thresholds in occupancy of said means for buffering for one neighboring node to said one neighboring node.
Claim 5
Independent Claim
69 words
A method for controling congestion in a packet transmission system comprising the steps of interconnecting a plurality of packet switching nodes by transmission links between pairs of said switching nodes, monitoring at each of said nodes the traffic intended for each other of said nodes, and in response to the relative monitored traffic between two adjacent nodes, adjusting the transmission rate for packets transmitted between said two adjacent nodes.
Claim 6
Independent Claim
69 words
A method for controling congestion in a packet transmission system comprising the steps of interconnecting a plurality of packet switching nodes by transmission links between pairs of said switching nodes, monitoring at each of said nodes the traffic intended for each other of said nodes, and in response to the relative monitored traffic between two adjacent nodes, adjusting the transmission rate for packets transmitted between said two adjacent nodes.
Claim 7
Dependent Claim
52 words
The method according to claim 4 further comprising the step of buffering, at each of said switching nodes, data packets intended for transmission to each neighboring switching node connected by one of said transmission links. said step of monitoring comprising the step of measuring the buffer utilization factor during said buffering step.
Claim 8
Dependent Claim
24 words
The method according to claim 5 further comprising the step of reporting every execution of said buffering step to at least one neighboring node.
Claim 9
Dependent Claim
41 words
The method according to claim 5 further comprising the step of reporting the crossing of any one of a plurality of preselected thresholds in the number of data packets simultaneously buffered in said buffering step to at least one neighboring node.
Claim 10
Dependent Claim
27 words
The method according to claim 12 further comprising the step of measuring, at said each of said switching nodes, the traffic arriving from each respective neighboring node.
Claim 11
Dependent Claim
86 words
The method according to claim 6 further comprising the step of utilizing a transmission rate from the node S to the adjacent node X given by ##EQU10## where BU S is the buffer utilization of a node S, BU X is the buffer utilization of an adjacent node X, f is a weighting function designed to gradually increase the transmission rate to full speed as BU S and BU X approach each other, and fullspeed is the maximum transmission rate from node S to node X.
Claim 12
Dependent Claim
189 words
The method according to claim 8 further comprising the step of utilizing a transmission rate Y X (S,i) from the node X to the adjacent node S given by ##EQU11## where S is one of said switching nodes, X is an immediate neighbor switching node to node S, B X (S,i) is the buffer utilization of node X reported to node Y X (S,i) is the rate of transmission from node X to node S, and OUT S (i) is the output rate from node S, where ##EQU12## where N S is the set of all immediate neighbors of S, X n (S,i) is the number of data packets which S transmits to an immediate neighbor n during f i , f i is a fixed period of time in a succession of periods of time having an index i, D S (i) is the number of data packets which terminate as S during f i , i.e., D S (i) is the number of packets which arrives at S as the final destination during f i , and r is a pre-defined reduction rate between zero and one.
Claim 13
Dependent Claim
201 words
The method according to claim 8 further comprising the step of utilizing a transmission rate Y X (S,i) from the node X to the adjacent node S given by ##EQU13## where S is one of said switching nodes, X is an immediate neighbor switching node to node S, B X (S,i) is the buffer utilization of node X reported to node Y X (S,i) is the rate of transmission from node X to node S, and OUT S (i) is the output rate from node S, where ##EQU14## where N S is the set of all immediate neighbors of S, X n (S,i) is the number of data packets which S transmits to an immediate neighbor n during f i , f i is a fixed period of time in a succession of periods of time having an index i, D S (i) is the number of data packets which terminate as S during f i , i.e., D S (i) is the number of packets which arrives at S as the final destination during f i , Δ is a pre-defined increment rate greater than zero, and fs is the maximum available transmission rate from node X to node S.
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) | 1997-06-06 | 1997-12-06 | 1998-06-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-06 | 2001-12-06 | 2002-06-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-06 | 2005-12-06 | 2006-06-07 | $7700.00 | Window Closed / Lapsed |