Relayed CSPF computation for multiple areas and multiple autonomous systems
US8837292B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 31, 2010 |
| Grant date | Sep 16, 2014 |
| Priority date | — |
| Expiry date | Nov 7, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/20
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.