Back to results
US 8,009,669 B2Granted
System of path computation element protocol support for large-scale concurrent path computation
AssigneeFuturewei Technologies, Inc.
InventorYoung Lee
Life of this patent
Estimating the term…
Abstract
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.
Claims27
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.
7 more elements
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.
7 more elements
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.
9 more elements
Dependencies are inferred from the claim text.