Techniques for network traffic engineering
First Claim
1. A method for traffic engineering in a network-based communication system, the method comprising the steps of:
- determining, in response to a request, whether any path of a plurality of predetermined paths meets at least one requirement corresponding to the request, wherein the plurality of predetermined paths are determined by substantially maximizing a carried demand on a network using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized carried demand; and
if a given path meeting the at least one requirement is found, attempting to create a connection utilizing the given path.
3 Assignments
0 Petitions
Accused Products
Abstract
In a traffic engineering technique, a determination is made as to whether any path of a number of predetermined paths meets requirements corresponding to a request. The predetermined paths are determined by substantially maximizing carried demand using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized carried demand. If a given path meeting the requirements is found, a connection on the given path is created, if possible. The predetermined paths are determined through offline TE techniques referred to herein as offline design-based routing (DBR). The requirements for the path may include a destination address and a bandwidth. The offline DBR techniques can include uncertain static demand information or dynamic connections. The offline DBR techniques may be used with adaptive DBR techniques, such that paths are determined offline if possible but can also use shortest path first (SPF), constrained SPF (CSPF) or other techniques during an online path determination. An improvement to a conventional CSPF technique is also presented.
74 Citations
23 Claims
-
1. A method for traffic engineering in a network-based communication system, the method comprising the steps of:
-
determining, in response to a request, whether any path of a plurality of predetermined paths meets at least one requirement corresponding to the request, wherein the plurality of predetermined paths are determined by substantially maximizing a carried demand on a network using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized carried demand; and
if a given path meeting the at least one requirement is found, attempting to create a connection utilizing the given path. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. An apparatus for traffic engineering for in a network-based communication system, the apparatus comprising:
-
a memory; and
at least one processor, coupled to the memory;
the apparatus operative;
to determine, in response to a request, whether any path of a plurality of predetermined paths meets at least one requirement corresponding to the request, wherein the plurality of predetermined paths are determined by substantially maximizing carried demand on a network using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized carried demand; and
if a given path meeting the at least one requirement is found, to attempt to create a connection utilizing the given path.
-
-
22. An article of manufacture for traffic engineering in a network-based communication system, the article of manufacture comprising:
-
a machine readable medium containing one or more programs which when executed implement the steps of;
determining, in response to a request, whether any path of a plurality of predetermined paths meets at least one requirement corresponding to the request, wherein the plurality of predetermined paths are determined by substantially maximizing carried demand on a network using at least traffic demand estimates and network topology information and by performing routing for the substantially maximized demand; and
if a given path meeting the at least one requirement is found, attempting to create a connection utilizing the given path.
-
-
23. A method for traffic engineering for a network-based communication system comprising a network having nodes interconnected through edges, and wherein a source node requests a connection to a destination node, the method comprising the steps of:
-
determining a first shortest path between the source node and destination node;
pruning edges not having a first available bandwidth from the network, thereby creating a first pruned network;
computing a second shortest path between the source node and the destination node using the first pruned network;
if a length of the second shortest path is equivalent to a length of the first shortest path, attempting to create a connection on the second shortest path; and
if a length of the second shortest path is not equivalent to a length of the first shortest path, performing the following steps;
pruning edges not having a second available bandwidth from the first pruned network, thereby creating a second pruned network;
computing a third shortest path between the source node and destination node using the second pruned network; and
attempting to create a connection on the third shortest path.
-
Specification