IP Library Granted Patent US 7,639,609
Granted Patent B2
US 7,639,609 · App. 11/778,053 · Granted Dec 29, 2009

Controlled incremental multi-protocol label switching (MPLS) traffic engineering

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,639,609
App. No.
11/778,053
Granted
Dec 29, 2009
Kind
B2
Abstract

An existing network configuration is assessed, and potential changes to the existing configuration are identified that provide the greatest incremental improvements to the performance of the network. In a preferred embodiment, the user of the system identifies the maximum number (N) of changes that may be implemented in an existing network, and the system provides a set of possible reconfigurations, each requiring fewer than N changes. The user is presented a display of the potential improvement provided by each set as a function of the number of changes in the set, so that the relative incremental gain can be easily visualized. The objective function of the optimization may include conventional load-balancing objectives, or other objectives, such as a global minimization of path lengths.

Claims (82)

1. A method comprising:

obtaining, at a network analysis system:

a model of a network that includes links between nodes of the network,

a current configuration of the network that includes a plurality of virtual circuits,

one or more constraints related to the virtual circuits, and

one or more objectives relative to optimizing the virtual circuits;

selectively unrouting a plurality of selected routes associated with one or more of the virtual circuits, the plurality of routes being substantially fewer than a totality of the routes associated with the plurality of virtual circuits;

rerouting, by the network analysis system, the plurality of the routes to produce a modified set of virtual circuits;

evaluating the modified set based on the one or more objectives, subject to the one or more constraints;

repeating the selective unrouting, rerouting, and evaluating to provide a plurality of modified sets of virtual circuits;

selecting, by the network analysis system, one or more preferred modified sets for presentation to a user based on an evaluation of each of the plurality of modified sets; and

presenting, by the network analysis system, a measure based on the evaluation of each of the preferred modified sets as a function of a number of changes in the set relative to the current configuration of the network.

2. The method of claim 1 , wherein the plurality of selected routes are selected based on a random process.

3. The method of claim 1 , wherein the number of changes in each set includes at least one of:

a number of circuits changed,

a number of routes changed, and

a number of devices whose configuration must be changed.

4. The method of claim 1 , wherein each of the one or more preferred modified sets of virtual circuits includes a number of changes relative to the current configuration of the network, and

the selecting of the one or more preferred modified sets is based on the number of changes in each of the sets.

5. The method of claim 4 , including setting an upper limit to the number of changes in each modified set of virtual circuits.

6. The method of claim 1 , wherein the plurality of virtual circuits include explicitly defined virtual circuits and dynamically defined virtual circuits.

7. The method of claim 1 , including:

selectively unrouting one or more of the routes based on a heuristic process; and

rerouting the one or more routes to produce a first modified set of virtual circuits.

8. The method of claim 7 , wherein the heuristic process includes identifying routes to be unrouted based on the virtual circuits routed over an oversubscribed link and a total number of oversubscribed links traversed by the route.

9. The method of claim 8 , wherein the heuristic process includes identifying routes to be unrouted based on the paths routed over an oversubscribed link and a product of the total number of oversubscribed links traversed by the route and a subscription bandwidth associated with the route.

10. The method of claim 7 , wherein the heuristic process includes identifying routes to be unrouted based on a failure of the route to satisfy one or more of the constraints.

11. The method of claim 1 , wherein the objective includes a minimization of a maximum link subscription.

12. The method of claim 1 , wherein the objective includes a minimization of a total amount of subscribed bandwidth.

13. The method of claim 1 , wherein the selective unrouting and evaluating are based on a method of simulated annealing.

14. The method of claim 1 , wherein the selective unrouting and evaluating are based on a genetic/evolutionary algorithm.

15. The method of claim 1 , including:

receiving a selection of a chosen set from the one or more preferred modified sets, and

providing one or more reports that are configured to contrast a new configuration based on the chosen set from the current configuration.

16. A system comprising:

an path optimizer that is configured to:

receive:

a model of a network that includes links between nodes of the network,

a current configuration of the network that includes a plurality of virtual circuits,

one or more constraints related to the virtual circuits, and

one or more objectives relative to optimizing the virtual circuits;

selectively unroute a plurality of selected routes associated with one or more of the virtual circuits, the plurality of routes being substantially fewer than a totality of the routes associated with the plurality of virtual circuits;

a router that is configured to reroute the plurality of the routes to produce a modified set of virtual circuits; and

a report generator;

wherein

the path optimizer is further configured to:

evaluate the modified set based on the one or more objectives, subject to the one or more constraints; and

repeat the selective unrouting, rerouting, and evaluating to provide a plurality of modified sets of virtual circuits; and

select one or more preferred modified sets of the plurality of modified sets for presentation to the user, based on an evaluation of each of the plurality of modified sets; and

the report generator is configured to present a measure based on the evaluation of each of the preferred modified sets as a function of the number of changes in the set relative to the current configuration.

17. The system of claim 16 , including a random search engine that is configured to select the plurality of selected routes.

18. The system of claim 16 , wherein the number of changes in each set includes at least one of:

a number of circuits changed,

a number of routes changed, and

a number of devices whose configuration must be changed.

19. The system of claim 16 , wherein each of the one or more preferred modified sets of virtual circuits includes a number of changes relative to the current configuration of the network, and

the path optimizer is configured to select the one or more preferred modified sets based on the number of changes in each of the sets.

20. The system of claim 19 , wherein the path optimizer is configured to set an upper limit to the number of changes in each modified set of virtual circuits.

21. The system of claim 16 , wherein the plurality of virtual circuits include explicitly defined virtual circuits and dynamically defined virtual circuits.

22. The system of claim 16 , wherein the path optimizer is configured to selectively unroute one or more of the routes based on a heuristic process.

23. The system of claim 22 , wherein the heuristic process includes identifying routes to be unrouted based on the virtual circuits routed over an oversubscribed link and a total number of oversubscribed links traversed by the route.

24. The system of claim 23 , wherein the heuristic process includes identifying routes to be unrouted based on the paths routed over an oversubscribed link and a product of the total number of oversubscribed links traversed by the route and a subscription bandwidth associated with the route.

25. The system of claim 22 , wherein the heuristic process includes identifying routes to be unrouted based on a failure of the route to satisfy one or more of the constraints.

26. The system of claim 16 , wherein the objective includes a minimization of a maximum link subscription.

27. The system of claim 16 , wherein the objective includes a minimization of a total amount of subscribed bandwidth.

28. The system of claim 16 , wherein the selective unrouting and evaluating are based on a method of simulated annealing.

29. The system of claim 16 , wherein the selective unrouting and evaluating are based on a genetic/evolutionary algorithm.

30. The system of claim 16 , including a user interface that is configured to:

receive a selection of a chosen set from the one or more preferred modified sets, and

provide one or more reports that are configured to contrast a new configuration based on the chosen set from the current configuration.

31. A non-transitory computer readable storage medium that includes a computer program that, when executed by a processing system, causes the processing system to:

receive:

a model of a network that includes links between nodes of the network,

a current configuration of the network that includes a plurality of virtual circuits,

one or more constraints related to the virtual circuits, and

one or more objectives relative to optimizing the virtual circuits;

selectively unroute a plurality of selected routes associated with one or more of the virtual circuits, the plurality of routes being substantially fewer than a totality of the routes associated with the plurality of virtual circuits; and

reroute the plurality of the routes to produce a modified set of virtual circuits;

evaluate the modified set based on the one or more objectives, subject to the one or more constraints; and

repeat the selective unrouting, rerouting, and evaluating to provide a plurality of modified sets of virtual circuits;

select one or more preferred modified sets of the plurality of modified sets, based on an evaluation of each of the plurality of modified sets; and

present a measure based on the evaluation of each of the preferred modified sets as a function of the number of changes in the set relative to the current configuration.

Assignments (21)
RELEASE OF SECURITY INTEREST Recorded Aug 11, 2023
From: ALTER DOMUS (US) LLC, AS COLLATERAL AGENT
To: RIVERBED TECHNOLOGY, INC.; ATERNITY LLC; RIVERBED HOLDINGS, INC.
Reel/Frame 064673/0739 →
CHANGE OF NAME Recorded Feb 18, 2022
From: RIVERBED TECHNOLOGY, INC.
To: RIVERBED TECHNOLOGY LLC
Reel/Frame 059232/0551 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Dec 27, 2021
From: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS U.S. COLLATERAL AGENT
To: RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
Reel/Frame 058593/0169 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Dec 27, 2021
From: ALTER DOMUS (US) LLC, AS COLLATERAL AGENT
To: RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
Reel/Frame 058593/0108 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Dec 27, 2021
From: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
To: RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
Reel/Frame 058593/0046 →
SECURITY INTEREST Recorded Dec 10, 2021
From: RIVERBED TECHNOLOGY LLC (FORMERLY RIVERBED TECHNOLOGY, INC.); ATERNITY LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS U.S. COLLATERAL AGENT
Reel/Frame 058486/0216 →
PATENT SECURITY AGREEMENT Recorded Oct 27, 2021
From: RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION
Reel/Frame 057943/0386 →
PATENT SECURITY AGREEMENT SUPPLEMENT - SECOND LIEN Recorded Oct 14, 2021
From: RIVERBED HOLDINGS, INC.; RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
To: ALTER DOMUS (US) LLC, AS COLLATERAL AGENT
Reel/Frame 057810/0559 →
PATENT SECURITY AGREEMENT SUPPLEMENT - FIRST LIEN Recorded Oct 14, 2021
From: RIVERBED HOLDINGS, INC.; RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
To: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
Reel/Frame 057810/0502 →
RELEASE OF SECURITY INTEREST IN PATENTS RECORED AT REEL 056397, FRAME 0750 Recorded Oct 13, 2021
From: MACQUARIE CAPITAL FUNDING LLC
To: RIVERBED HOLDINGS, INC.; RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
Reel/Frame 057983/0356 →
SECURITY INTEREST Recorded May 26, 2021
From: RIVERBED HOLDINGS, INC.; RIVERBED TECHNOLOGY, INC.; ATERNITY LLC
To: MACQUARIE CAPITAL FUNDING LLC
Reel/Frame 056397/0750 →
PATENT SECURITY AGREEMENT Recorded Mar 5, 2021
From: RIVERBED TECHNOLOGY, INC.
To: ALTER DOMUS (US) LLC, AS COLLATERAL AGENT
Reel/Frame 055514/0249 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTY NAME PREVIOUSLY RECORDED ON REEL 035521 FRAME 0069. ASSIGNOR(S) HEREBY CONFIRMS THE RELEASE OF SECURITY INTEREST IN PATENTS. Recorded Jun 2, 2015
From: JPMORGAN CHASE BANK, N.A.
To: RIVERBED TECHNOLOGY, INC.
Reel/Frame 035807/0680 →
SECURITY INTEREST Recorded May 1, 2015
From: RIVERBED TECHNOLOGY, INC.
To: MORGAN STANLEY SENIOR FUNDING, INC., AS COLLATERAL AGENT
Reel/Frame 035561/0363 →
RELEASE OF SECURITY INTEREST IN PATENTS Recorded Apr 28, 2015
From: BARCLAYS BANK PLC
To: RIVERBED TECHNOLOGY, INC.
Reel/Frame 035521/0069 →
PATENT SECURITY AGREEMENT Recorded Dec 27, 2013
From: RIVERBED TECHNOLOGY, INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 032421/0162 →
RELEASE OF PATENT SECURITY INTEREST Recorded Dec 26, 2013
From: MORGAN STANLEY & CO. LLC, AS COLLATERAL AGENT
To: RIVERBED TECHNOLOGY, INC.
Reel/Frame 032113/0425 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 21, 2013
From: OPNET TECHNOLOGIES LLC
To: RIVERBED TECHNOLOGY, INC.
Reel/Frame 030462/0148 →
CHANGE OF NAME Recorded May 14, 2013
From: OPNET TECHNOLOGIES, INC.
To: OPNET TECHNOLOGIES LLC
Reel/Frame 030411/0273 →
SECURITY AGREEMENT Recorded Dec 20, 2012
From: RIVERBED TECHNOLOGY, INC.; OPNET TECHNOLOGIES, INC.
To: MORGAN STANLEY & CO. LLC
Reel/Frame 029646/0060 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 16, 2007
From: BOLT, GORDON; SYKES, EDWARD A.; LIU, YU
To: OPNET TECHNOLOGIES, INC.
Reel/Frame 019558/0558 →