Patent US6731739B2 successfully refreshed from Google Patents.
US6731739B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Balancing loads on telecommunications links
Assignee: Unwired Planet LLC
•
Filing: 2000-12-11
•
Granted: 2004-05-04
•
Expires: 2020-12-11
Abstract
Abstract A telecommunications network (110) has a unit (100) and technique to alleviate congestion on a congested link as can occur, e.g., when a new connection seeks admission to the network. The congestion avoidance technique/unit ascertains, from a set of candidate connections (C0, C1, C2, C3), a best candidate to route in order to avoid the congestion. Further, the congestion avoidance technique/unit determines a best candidate path to which the best candidate connection is to be routed. The best candidate connection and the best candidate path are determined so that, after routing the best candidate connection to the best candidate path, a load of the weakest link in the network is as low as possible.
Inventors
- 👤 Wesa Riihinen
- 👤 Johan Söderberg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 20:13
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/12; H04L47/125; H04W; H04W28/00; H04W28/02; H04W28/08; H04W28/082; H04W8/00; H04W8/02; H04W8/04
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
210 words
A method of operating a telecommunications network to alleviate congestion on a congested link, the telecommunications network having plural nodes including a common node, a plurality of connections being carried by the telecommunications network, each of the plurality of connections being carried over one of plural paths of the network, each path including at least one link, each link connecting two of the plural nodes, each of the plural paths being connected to the common node by one of the plural links, wherein the method comprises: determining, for routing purposes, a best candidate connection from a set of candidate connections; determining a best candidate path to carry the best candidate connection; the best candidate connection and the best candidate path being determined so that, after routing the best candidate connection to the best candidate path, (congestion on the congested link is alleviated and) a load of the weakest link in the network is as low as possible; developing, for each candidate connection, a network topology connection subtraction load scenario, each connection subtraction load scenario having a load for the corresponding candidate connection subtracted therefrom; determining a weakest link of each connection subtraction load scenario, whereby for each candidate connection there is a weakest link of its connection subtraction load scenario.
Claim 2
Independent Claim
210 words
A method of operating a telecommunications network to alleviate congestion on a congested link, the telecommunications network having plural nodes including a common node, a plurality of connections being carried by the telecommunications network, each of the plurality of connections being carried over one of plural paths of the network, each path including at least one link, each link connecting two of the plural nodes, each of the plural paths being connected to the common node by one of the plural links, wherein the method comprises: determining, for routing purposes, a best candidate connection from a set of candidate connections; determining a best candidate path to carry the best candidate connection; the best candidate connection and the best candidate path being determined so that, after routing the best candidate connection to the best candidate path, (congestion on the congested link is alleviated and) a load of the weakest link in the network is as low as possible; developing, for each candidate connection, a network topology connection subtraction load scenario, each connection subtraction load scenario having a load for the corresponding candidate connection subtracted therefrom; determining a weakest link of each connection subtraction load scenario, whereby for each candidate connection there is a weakest link of its connection subtraction load scenario.
Claim 3
Dependent Claim
24 words
The method of claim 1 , further comprising forming the set of candidate connections with a plurality of connections which use a congested link.
Claim 4
Dependent Claim
98 words
The method of claim 1 , further comprising: (a) for a particular candidate connection, developing a set of network topology path load scenarios, each path load scenario being developed by augmenting the connection subtraction load scenario for the particular candidate connection with a unique path assignment for the particular candidate connection; (b) determining, for each network topology path load scenario of the set, a weakest link comprising the unique path assignment; (c) determining, from the entire set of network topology path load scenarios, a strongest one of weakest links determined in step (b) for the particular candidate connection.
Claim 5
Dependent Claim
87 words
The method of claim 3 , further comprising: (d) determining a weakest link for the for the network topology path load scenario having the strongest one of the weakest links as determined in step (c); and (e) for the particular candidate connection, using the weakest link determined at step (d) as the weakest link of its connection subtraction load scenario if the strength of the weakest link determined at step (d) exceeds the strength of the weakest link of its connection subtraction load scenario as previously determined.
Claim 6
Dependent Claim
56 words
The method of claim 4 , wherein the candidate connection having a strongest weakest link of its connection subtraction load scenario is chosen as the best candidate connection, and wherein for the best candidate connection the unique path assignment determined as having the strongest one of the weakest links is used as the best candidate path.
Claim 7
Dependent Claim
22 words
The method of claim 1 , wherein the plural nodes include radio network controller (RNC) nodes of a radio access network (RAN).
Claim 8
Dependent Claim
15 words
The method of claim 6 , wherein the common node is a core network node.
Claim 9
Dependent Claim
18 words
The method of claim 1 , wherein the steps of claim 1 are performed at the common node.
Claim 10
Dependent Claim
196 words
A telecommunications network which carries a plurality of telecommunication connections, the network comprising: plural nodes including a common node; plural paths, each of the plurality of connections being carried over one of plural paths, each path including at least one link, each link connecting two of the plural nodes, each of the plural paths being connected to the common node by one of the plural links; a connection handler which alleviates congestion on a congested link by performing the operations of: determining, for routing purposes, a best candidate connection from the plurality of connections; determining a best candidate path to carry the best candidate connection, the best candidate connection and the best candidate path being determined so that, after routing the best candidate connection to the best candidate path, a load of the weakest link in the network is as low as possible; developing, for each candidate connection, a network topology connection subtraction load scenario, each connection subtraction load scenario having a load for the corresponding candidate connection subtracted therefrom; determining a weakest link of each connection subtraction load scenario, whereby for each candidate connection there is a weakest link of its connection subtraction load scenario.
Claim 11
Dependent Claim
196 words
A telecommunications network which carries a plurality of telecommunication connections, the network comprising: plural nodes including a common node; plural paths, each of the plurality of connections being carried over one of plural paths, each path including at least one link, each link connecting two of the plural nodes, each of the plural paths being connected to the common node by one of the plural links; a connection handler which alleviates congestion on a congested link by performing the operations of: determining, for routing purposes, a best candidate connection from the plurality of connections; determining a best candidate path to carry the best candidate connection, the best candidate connection and the best candidate path being determined so that, after routing the best candidate connection to the best candidate path, a load of the weakest link in the network is as low as possible; developing, for each candidate connection, a network topology connection subtraction load scenario, each connection subtraction load scenario having a load for the corresponding candidate connection subtracted therefrom; determining a weakest link of each connection subtraction load scenario, whereby for each candidate connection there is a weakest link of its connection subtraction load scenario.
Claim 12
Dependent Claim
105 words
The network of claim 9 , wherein the connection handler performs the further operations of: (a) for a particular candidate connection, developing a set of network topology path load scenarios, each path load scenario being developed by augmenting the connection subtraction load scenario for the particular candidate connection with a unique path assignment for the particular candidate connection; (b) determining, for each network topology path load scenario of the set, a weakest link comprising the unique path assignment; (c) determining, from the entire set of network topology path load scenarios, a strongest one of weakest links determined in step (b) for the particular candidate connection.
Claim 13
Dependent Claim
94 words
The network of claim 10 , wherein the connection handler performs the further operations of: (d) determining a weakest link for the for the network topology path load scenario having the strongest one of the weakest links as determined in step (c); and (e) for the particular candidate connection, using the weakest link determined at step (d) as the weakest link of its connection subtraction load scenario if the strength of the weakest link determined at step (d) exceeds the strength of the weakest link of its connection subtraction load scenario as previously determined.
Claim 14
Dependent Claim
61 words
The network of claim 11 , wherein the connection handler performs the further operations of: choosing as the best candidate connection the candidate connection having a strongest weakest link of its connection subtraction load scenario; and for the best candidate connection, using the unique path assignment determined as having the strongest one of the weakest links as the best candidate path.
Claim 15
Dependent Claim
22 words
The network of claim 9 , wherein the plural nodes include radio network controller (RNC) nodes of a radio access network (RAN).
Claim 16
Dependent Claim
15 words
The network of claim 13 , wherein the common node is a core network node.
Claim 17
Dependent Claim
16 words
The network of claim 9 , wherein the connection handler is situated at the common node.
Claim 18
Dependent Claim
15 words
The network of claim 15 , wherein the common node is a core network node.
References Cited (Backward Citations)
US4670899A
Cited
US4905233A
Cited
US5317562A
Cited
US5444848A
Cited
US5930249A
Cited
US5654958A
Cited
US5590126A
Cited
US5956339A
Cited
US6014567A
Cited
WO1999023842A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-05-04 | 2007-11-03 | 2008-05-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-05-04 | 2011-11-03 | 2012-05-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-05-04 | 2015-11-03 | 2016-05-04 | $7700.00 | Window Closed / Lapsed |