A system for a global concurrent path computation in a communication network is disclosed. The system includes a path computation element communication protocol, wherein the protocol includes an indicator field indicating the global concurrent path computation, a global objective function field providing an overarching objective function, a global constraint field specifying at least one global constraint, a global concurrent vector field specifying at least one path computation request, and another indicator field indicating an outcome of a path computation request.
|
1. A system for a global concurrent path computation in a communication network, comprising:
a plurality of nodes;
a plurality of links disposed between the nodes;
a plurality of traffic engineering label Switched Paths (TE-LSPs) extending across at least some of the nodes and at least some of the links;
at least one path computation element (pce) in communication with at least some of the nodes and configured to compute the TE-LSPs; and
at least one pce agent in communication with the pce and configured to process a TE-LSP path computation request;
wherein the global concurrent path computation concurrently computes a plurality of TE-LSPs extending from the plurality of nodes,
wherein the global concurrent path computation is performed in the at least one pce through communication with the at least one pce agent using a pce communication protocol, and
wherein the pce communication protocol comprises a global objective function field providing an overarching objective function, and
wherein the global objective function field comprises at least one field for minimizing a load on a most used link.
20. A network element comprising:
a transmitter configured to transmit a data structure associated with a path spanning a plurality of nodes and a plurality of links, the data structure comprising:
a first indicator field indicating the global concurrent path computation;
a global objective function field that indicates that a global objective function is to minimize a load on a most used link; and
a global constraint field specifying at least one global constraint comprising a maximum number of hops for at least some of the paths, a maximum utilization for at least some of the links, a minimum utilization for at least some of the links, or combinations thereof;
a global concurrent vector field specifying at least one path computation request for functions of the global objective function field and the global constraint field;
a second indicator field indicating an outcome of a path computation request; and
a multi-session indicator field indicating a session of a plurality of path computation requests is divided into a plurality of sessions, and
wherein the global constraint further comprises an exclusion of a node, a link, or both from the path.
21. A method comprising:
receiving a path computation request comprising a global objective function field that indicates an objective for a global concurrent path computation; and
performing the global concurrent path computation, thereby producing a plurality of paths,
wherein the path computation request is originated by a pce agent that is not part of any of the paths;
wherein the path computation request further comprises:
a first indicator field indicating the global concurrent path computation; a global constraint field specifying at least one global constraint;
a global concurrent vector field specifying at least one path computation request for functions of the global objective function field and the global constraint field;
and a second indicator field indicating an outcome of a path computation request,
wherein performing the global path computation uses the objective to compute a first path extending from a first node and a second path extending from a second node,
wherein the computation of the first path and the second path is performed concurrently at a central location, and
wherein the set of paths comprises the plurality of paths.
2. The system in
3. The system in
4. The system in
a minimum link utilization parameter for all links;
a maximum number of hops for the TE-LSPs;
at least some of the links, at least some of the nodes, or both to exclude from the path computation; and
at least some of the TE-LSPs that should not be modified in the path computation.
5. The system in
6. The system in
7. The system in
8. The system in
9. The system in
a first indicator field indicating the global concurrent path computation;
a global constraint field specifying at least one global constraint;
a global concurrent vector field specifying at least one path computation request for functions of the global objective function field and the global constraint field; and
a second indicator field indicating an outcome of a path computation request.
10. The system in
11. The system in
12. The system in
13. The system in
14. The system in
15. The system in
16. The system in
the at least one pce agent sends a session of a plurality of path computation requests to the at least one pce,
the at least one pce performs a path computation and determines that the session is infeasible for the global path computation, and reply to the at least one pce agent,
the at least one pce agent partitions the session to a plurality of iterative sessions that are feasible for the global path computation,
the at least one pce agent sends each of the plurality of iterative sessions to the at least one pce, and
the at least one pce performs the global path computation for each of the plurality of sessions using the pce communication protocol, and replies to the at least one pce agent after each global path computation for each of the plurality of iterative sessions.
17. The system in
22. The method of
23. The method of
24. The method of
25. The method of
26. The system of
27. The system in
|
|||||||||||||||||||||||||||||
This application is related to: U.S. application Ser. No. 11/549,740, filed concurrently with the present invention on Oct. 16, 2006, entitled “DISTRIBUTED PCE-BASED SYSTEM AND ARCHITECTURE IN A MULTI-LAYER NETWORK”, by Young Lee.
The present invention generally relates to path computation in communication networks, and more specifically, relates to path computation element protocol in support of a large-scale concurrent path computation in communication networks.
A Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network topology, and applying computational constraints to the computation. The capability of a PCE to compute different types of paths allows a PCE to provide traffic engineering functions.
A PCE-based network architecture defines PCEs to perform computation of a multi-layer path, and take constraints into consideration. A multi-layer network may be considered as distinct path computation regions within a PCE domain, and therefore, a PCE-based architecture is useful to allow path computation from one layer network region, across the multi-layer network, to another layer network region. A PCE may be placed on a single network node with high processing capabilities, or several PCEs might be deployed on nodes across a network.
A large-scale path computation need may arise when network operators need to set up a large number of Traffic Engineering Label Switched Paths (TE-LSPs) in a network planning process. Hence, a large-scale path computation is typically an off-line computation.
The off-line computation requirements to support a large number of TE-LSPs are quite different from on-line path computation requirements. While on-line path computation is focused on finding the best path given network conditions in timely manner, a large-scale off-line path computation application involves finding a large number of TE-LSPs that concurrently meet a global objective.
While off-line computation may not require as stringent time constraint as on-line path computation, the key objective associated with large-scale off-line computation is to efficiently allocate network resources from a global network perspective. While on-line path computation is tactical, off-line large-scale path computation is strategic.
As a Path Computation Element (PCE) is considered to provide solutions in path computation in a communication network, a PCE may provide solutions for large-scale off-line concurrent path computation needs.
Therefore, there is a need for a system that provides efficient and feasible capability enabling a PCE to perform a global concurrent path computation.
The present invention discloses a versatile system for a global concurrent path computation in a network planning. The system provides a path computation element (PCE) communication protocol that may be used in communication between a PCE agent and a PCE for the global concurrent path computation. This protocol may include an indicator field indicating the global concurrent path computation, a global objective function field providing an overarching objective function, a global constraint field specifying at least one global constraint, a global concurrent vector field specifying at least one path computation request for functions of the global objective function field and the global constraint field, and another indicator field indicating an outcome of a path computation request.
In addition, the present invention further discloses an iterative path computation when a PCE receives a session of infeasible path computation requests from a PCE agent. The iterative path computation comprises the steps of the PCE agent partitions the session of infeasible path computation requests to a plurality of sessions that are feasible for path computation, and the PCE performs a path computation for each of the plurality of sessions using the PCE communication protocol and replies to the PCE agent after each path computation.
For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:
The present invention is hereafter in relation to certain exemplary embodiments below. It is understood, however, that the embodiments below are not necessarily limitations to the present disclosure. Although only a few exemplary embodiments of this invention have been described in detail, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments. It is understood that modifications, changes and substitutions are intended in the foregoing disclosure, and in some instances some features of the invention will be employed without a corresponding use of other features.
The present invention provides a system for a large-scale concurrent path computation in a network planning. A large-scale concurrent path computation is a path computation application where a large number of traffic engineering paths need to be computed concurrently in order to efficiently utilize network recourses. This large-scale concurrent path computation is referred to as a global concurrent path computation. The global concurrent path computation described in the present invention is typically conducted off-line. However, the global concurrent path computation may also be conducted on-line, particularly when a system encounters a catastrophic failure.
Referring to
PCE agent (106) may have many functions including, but not limited to: initiating a global concurrent path computation to PCE (102) based on a traffic demand matrix in System (100); formulating a global concurrent path computation request to PCE (102); interacting with a policy server to derive all decision parameters required in the global concurrent path computation; and facilitating PCE (102) to perform an iterative path computation when the global concurrent path computation fails.
When PCE (102) determines that one session of a plurality of global concurrent path computation requests sent by PCE agent (106) is infeasible, upon receiving a reply from PCE (102), PCE agent (106) may partition the session into a plurality of sessions, each of the plurality of sessions may be feasible for PCE (102) to perform a path computation. In addition, PCE agent (106) may correlate each of the plurality of sessions and interact with PCE (102) to avoid double booking when PCE (102) performs the iterative path computation.
Moreover, when PCE (102) can compute point-to-multipoint paths, PCE agent (106) may derive point-to-multipoint traffic matrix for point-to-multipoint path computation.
To perform a global concurrent path computation, the present invention provides a system for implementing a PCE communication protocol. This PCE communication protocol may provide capabilities either through creation of new objects and/or modification to existing objects in a PCE based system.
This protocol may include:
An indicator to convey that a path communication request is a global concurrent path computation. This indicator may ensure consistency in applying global objectives and global constraints in all path computations.
A Global Objective Function (GOF) field in which to specify a global objective function. The global objective function may be an overarching objective function to which all individual path computation requests are subjected in order to find a globally optimal solution. The field may include following objective functions at the minimum and should be expandable for future addition: minimize the sum of all Traffic Engineering Label Switched Path (TE-LSP) costs; and minimize the most utilized TE-LSPs.
A Global Constraints (GC) field in which to specify a list of global constraints to which all the requested path computations may be subjected in its path computations. This list may include the following constraints and may be expandable for future addition: maximum link utilization parameter (between 0 and 1) for all links; minimum link utilization parameter (between 0 and 1) for all links; maximum number of hops for all the TE-LSPs; exclusion of links/nodes in all TE-LSP path computations (i.e., all LSPs should not include the specified links/nodes in the path); and a list of existing or known TE-LSPs that may be kept intact without any modification. This capability may be useful in minimizing disruption when a global reconfiguration may need to be made.
A Global Concurrent Vector (GCV) field in which to specify all individual path computation requests that are subject to concurrent path computation and subject to the global objective function and all of the global constraints.
An indicator field to indicate an outcome of a path computation request. When PCE (102) can not find a feasible solution with an initial request, the indicator may indicate a reason for infeasibility. The reason may be a feasible solution found; mathematically infeasible; or a memory overflow.
A Multi-Session Indicator field in a situation where the original request is sub-divided into a plurality of sessions. This situation may arise when the reason for infeasibility of the original request is due to mathematically infeasibility, or due to memory overflow. PCE agent (106) may follow up with subsequent actions under a local policy. PCE agent (106) may decide to scale down the original request into several sessions and make requests to PCE (102) in several sessions. This is to find a partial feasible solution in the absence of an optimal solution.
Regarding the Multi-Session Indicator field, a list of existing TE-LSPs that should be kept without any modification (Note that this may be indicated in the aforementioned Global Constraints (GC) field). During multiple sessions of path computations, the successfully computed paths from PCE (102) to PCE agent (106) in a session may be indicated as a constraint (i.e., as the TE-LSPs that should be kept) in a next session computation by PCE (102) so that PCE (102) may avoid double booking. If PCE (102) is a stateless PCE, this indication is essential.
When PCE agent (106) receives a path computation result that indicates that the original computation request is infeasible (mathematically or memory overflow), it may try another option under policy. The policy option is “iterative path computation.” Iterative path computation may partition one session of concurrent path computation requests (say M total path computation request) into N sessions (M>N) so that each session would require less computational burden than one single big session. This option may be exercised when a large scale optimization computation fails to find a feasible solution.
When session of a plurality of path computation requests is sent to PCE (102) by PCE agent (106), PCE agent (106) may correlate all these multiple sessions and interact appropriately with PCE (102) for each session. In order to avoid a double booking by PCE (102) which normally is a stateless PCE, it is critical for PCE agent (106) to make PCE (102) be aware of the already committed resources associated with the sessions.
In these iterative sessions, PCE agent (216) may include a list of new path computation requests, as well as information on an LSP bandwidth already committed to resulting LSPs in the first session as part of the Global Constraint (GC) for that particular computation. The already committed bandwidth information may be considered in order for PCE (212) to avoid double booking in a new path computation associated with a new session.
This process may be repeated until all iterative sessions are completed. At step (297), PCE agent (216) sends a last iterative session to PCE (212), and at step (298) PCE (212) performs a path computation based on the last iterative session and replies to PCE agent (216). The iterative path computation may find a feasible solution in the absence of a global optimal solution. While sequential path computation (computing path one by one) is expected to result in sub-optimal solution far from the global optimal solution, iterative path computation tries to find a middle ground between sequential path computation and simultaneous path computation.
The present invention provides a global path computation that may be applied to a number of systems. One such system is Greenfield Traffic Engineering. When a new traffic engineering network needs to be provisioned from a green-field perspective, large numbers of TE-LSPs need to be created based on a traffic demand, topology and network resources. Under this scenario, concurrent computation ability is highly desirable or required to utilize network resources in an optimal manner. Sequential path computation could potentially result in sub-optimal use of network resources.
Another application involves existing network re-optimization. A need for concurrent path computation in a large scale may also arise in existing networks. When existing TE-LSP networks experience sub-optimal use of resources, a need for re-optimization or reconfiguration may arise. The scope of re-optimization and reconfiguration may vary depending on particular situations. The scope of re-optimization may be limited to bandwidth modification to an existing TE-LSP. However, a large number of TE-LSPs may need to be re-optimized concurrently. In an extreme case, TE-LSPs may need to be globally re-optimized.
Another example is multi-layer traffic engineering. When an optical transport layer provides lower-layer traffic engineered LSPs for upper-layer client LSPs via a Hierarchical LSP (H-LSP) mechanism, an operator may desire to pre-establish optical LSPs in an optical transport network. In this scenario, a large number of H-LSPs may be created concurrently to efficiently utilize network resources. Again, concurrent path computation capability may result in an efficient network resource utilization.
Still another application is reconfiguration of a network using Virtual Network Topology (VNT). A concurrent large-scale path computation may be applicable in an VNT reconfiguration. Triggers for the VNT reconfiguration, such as traffic demand changes and topological configuration changes, may require a large set of existing LSPs to be re-allocated. A concurrent path computation capability may result in an efficient network resource utilization.
The previous description of the disclosed embodiments is provided to enable those skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art and generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
| Patent | Priority | Assignee | Title |
| 10230618, | Jun 26 2013 | HUAWEI TECHNOLOGIES CO , LTD | Path acquisition method, path computation element, path computation client and system |
| 10250459, | Nov 21 2012 | Cisco Technology, Inc. | Bandwidth on-demand services in multiple layer networks |
| 8837475, | Nov 12 2009 | ZTE Corporation | Method for controlling area boundary, method and system for establishing connection in multilayer network |
| 8964738, | Oct 16 2006 | FUTUREWEI TECHNOLOGIES, INC | Path computation element protocol support for large-scale concurrent path computation |
| 9444712, | Nov 21 2012 | Cisco Technology, Inc. | Bandwidth on-demand services in multiple layer networks |
| Patent | Priority | Assignee | Title |
| 5680580, | Feb 28 1995 | International Business Machines Corporation | Remote copy system for setting request interconnect bit in each adapter within storage controller and initiating request connect frame in response to the setting bit |
| 5872918, | Aug 11 1995 | TELEFONAKTIEBOLAGET L M ERICSSON PUBL | System and method for optimal virtual path capacity dimensioning with broadband traffic |
| 6807179, | Apr 18 2000 | Advanced Micro Devices, Inc. | Trunking arrangement in a network switch |
| 7426562, | Jul 11 2003 | AT&T Corp.; AT&T Corp | Method for network capacity planning with proper accounting of spare capacity |
| 20010012298, | |||
| 20030217129, | |||
| 20040081105, | |||
| 20050111349, | |||
| 20060023587, | |||
| 20060039391, | |||
| 20060098657, | |||
| 20060101142, | |||
| 20060212556, | |||
| 20060268682, | |||
| 20070019558, | |||
| 20070058568, | |||
| CN1866852, | |||
| CN1870570, | |||
| JP2004129135, | |||
| WO2005107192, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Oct 16 2006 | Futurewei Technologies, Inc. | (assignment on the face of the patent) | / | |||
| Oct 16 2006 | LEE, YOUNG, MR | FUTUREWEI TECHNOLOGIES, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 018394 | /0748 |
| Date | Maintenance Fee Events |
| Feb 11 2015 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
| Feb 14 2019 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
| Feb 15 2023 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
| Date | Maintenance Schedule |
| Aug 30 2014 | 4 years fee payment window open |
| Mar 02 2015 | 6 months grace period start (w surcharge) |
| Aug 30 2015 | patent expiry (for year 4) |
| Aug 30 2017 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Aug 30 2018 | 8 years fee payment window open |
| Mar 02 2019 | 6 months grace period start (w surcharge) |
| Aug 30 2019 | patent expiry (for year 8) |
| Aug 30 2021 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Aug 30 2022 | 12 years fee payment window open |
| Mar 02 2023 | 6 months grace period start (w surcharge) |
| Aug 30 2023 | patent expiry (for year 12) |
| Aug 30 2025 | 2 years to revive unintentionally abandoned end. (for year 12) |