×

Disjoint Path Computation Algorithm

  • US 20110110226A1
  • Filed: 11/06/2009
  • Published: 05/12/2011
  • Est. Priority Date: 11/06/2009
  • Status: Active Grant
First Claim
Patent Images

1. A method performed on a network element implementing Multiprotocol Label Switching (MPLS) to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP, the method comprising the steps of:

  • receiving a request for a generation of an LSP by the network element via a signaling protocol;

    determining that the request for the generation of the LSP is for the back-up LSP;

    locating each link of the primary LSP in a traffic engineering database in response to determining that the request is for the back-up LSP;

    modifying each link of the primary LSP in the traffic engineering database to have a link cost other than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP;

    executing a Constrained Shortest Path First (CSPF) algorithm on the traffic engineering database to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP in the traffic engineering database; and

    returning the back-up LSP via the signaling protocol.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×