Relayed CSPF Computation for Multiple Areas and Multiple Autonomous Systems
AssigneeTelefonaktiebolaget L M Ericsson (publ)
InventorsWenhu Lu, Sriganesh Kini, Srikanth Narayanan
Life of this patent
Estimating the term…
Loading patent…
AssigneeTelefonaktiebolaget L M Ericsson (publ)
InventorsWenhu Lu, Sriganesh Kini, Srikanth Narayanan
Estimating the term…
Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router. The router stitches at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP.
A method in a router for participating in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination, the router included within a first one of the plurality of areas, the method comprising the steps of:
A method in a router for participating in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination, wherein the router resides in a first one of the plurality of areas and the destination is in the first area, the method comprising the steps of:
An apparatus to participate in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination, the apparatus comprising:
An apparatus to participate in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination, the apparatus comprising:
Dependencies are inferred from the claim text.