Patent US5546377A successfully refreshed from Google Patents.
US5546377A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Efficient distributed method for computing max-min fair rates of a limited resource in ATM networks
Assignee: Extreme Networks Inc
•
Filing: 1995-10-31
•
Granted: 1996-08-13
•
Expires: 2015-10-31
Abstract
Abstract The distributed computation of max-min fair rates in general require lookups for all connections. This present method includes a distributed process for computing max-min fair rates in response to a rate allocation request by any connection. The method computes the optimal rate by performing a single lookup of the state for a particular connection. The discrepancies due to omitting the lookup for other connections are corrected when those connections request a rate allocation.
Inventors
- 👤 Cuneyt M. Ozveren
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 15:14
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/30; H04L49/3081; H04L49/50; H04L49/505; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/5629; H04L2012/5631; H04L2012/5632
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
259 words
A method for computing fair rates in a computer network comprising the steps of: providing a plurality of source nodes; providing a plurality of destination nodes; providing a plurality of switches to connect each one of the plurality of source nodes to each one of the plurality of destination nodes; selecting a first switch, the first switch having an associated allocated bandwidth; selecting a first source node, the first source node establishing a first connection to the first switch; selecting a first destination node, the first destination node establishing a second connection to the first switch; sending a plurality of data cells from the first source node via the first connection to the first switch, one of the data cells being a forward resource management cell containing a forward rate request value; reading the forward rate request value; computing a computed fair rate request value from the forward rate request value; sending a plurality of data cells from the first destination via the second connection to the first switch, one of the data cells being a reverse resource management cell having a reverse rate request value; reading the reverse rate request value; comparing the computed rate request value and the reverse rate request value; inserting the computed rate request value into the reverse resource management cell if the computed rate request value is less than the reverse rate request value; and adjusting a rate at which said plurality of cells are sent from said first source node acceding to the rate request value in the reverse resource management cell.
Claim 2
Independent Claim
259 words
A method for computing fair rates in a computer network comprising the steps of: providing a plurality of source nodes; providing a plurality of destination nodes; providing a plurality of switches to connect each one of the plurality of source nodes to each one of the plurality of destination nodes; selecting a first switch, the first switch having an associated allocated bandwidth; selecting a first source node, the first source node establishing a first connection to the first switch; selecting a first destination node, the first destination node establishing a second connection to the first switch; sending a plurality of data cells from the first source node via the first connection to the first switch, one of the data cells being a forward resource management cell containing a forward rate request value; reading the forward rate request value; computing a computed fair rate request value from the forward rate request value; sending a plurality of data cells from the first destination via the second connection to the first switch, one of the data cells being a reverse resource management cell having a reverse rate request value; reading the reverse rate request value; comparing the computed rate request value and the reverse rate request value; inserting the computed rate request value into the reverse resource management cell if the computed rate request value is less than the reverse rate request value; and adjusting a rate at which said plurality of cells are sent from said first source node acceding to the rate request value in the reverse resource management cell.
Claim 3
Dependent Claim
84 words
The method for computing fair rates in a computer network according to claim 1 wherein the step of computing the computed fair rate value in the first switch comprises the steps of: initializing a set of system dependent variables; determining whether a bottleneck condition state exists in the first switch; adjusting the bottleneck condition state in response to the step of determining; computing a fair allocation in response to the step of determining; and setting the computed fare rate value to the fair allocation.
Claim 4
Dependent Claim
71 words
The method for computing fair rates in a computer network according to claim 2 wherein the step of initializing the set of system dependent variables comprises the steps of: setting the fair rate value to zero; setting the bottleneck condition state for the first switch to zero; setting a number representing a number of bottlenecked connections at the first switch to zero; and setting a number of non-bottlenecked connections to zero.
Claim 5
Dependent Claim
38 words
The method for computing fair rates in a computer network according to claim 2 wherein the step adjusting the bottleneck condition state in response to the step of determining comprises the step of resetting the bottleneck connection state.
Claim 6
Dependent Claim
73 words
The method of computing fare rates in a computer network according to claim 4 wherein the step of resetting the bottleneck state comprises the steps of: setting the allocated bandwidth to the allocated bandwidth minus the rate request if the bottleneck state equals zero; and setting the number of connections bottlenecked at the first switch to the number of connections bottlenecked at the first switch minus one if the bottleneck state equals one.
Claim 7
Dependent Claim
112 words
The method of computing fair rates in a computer network according to claim 5 wherein the step of computing the computed fare rate further comprises the steps of: setting the computed fair rate to the requested rate and allocated bandwidth to the allocated bandwidth plus the fair rate if the bottleneck condition state is zero; setting the computer fair rate to the quotient of link capacity of the first switch minus the total bandwidth allocated to non-bottlenecked connections and the number of bottlenecked connections plus one if the bottleneck connection state is zero; and setting the number of connections bottlenecked at the first switch to the number of connections bottlenecked plus one.
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) | 1999-08-13 | 2000-02-12 | 2000-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-08-13 | 2004-02-12 | 2004-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-08-13 | 2008-02-12 | 2008-08-13 | $7700.00 | Window Closed / Lapsed |