Invention Grant
- Patent Title: Disjoint path computation algorithm
- Patent Title (中): 不相交路径计算算法
-
Application No.: US13457192Application Date: 2012-04-26
-
Publication No.: US08681607B2Publication Date: 2014-03-25
- Inventor: Wenhu Lu , Sriganesh Kini
- Applicant: Wenhu Lu , Sriganesh Kini
- Applicant Address: SE Stockholm
- Assignee: Telefonaktiebolaget L M Ericsson (publ)
- Current Assignee: Telefonaktiebolaget L M Ericsson (publ)
- Current Assignee Address: SE Stockholm
- Agency: Blakely, Sokoloff, Taylor & Zafman, LLP
- Main IPC: G01R31/08
- IPC: G01R31/08

Abstract:
A network element implementing Multiprotocol Label Switching 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 network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm 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, and returns the back-up LSP.
Public/Granted literature
- US20120213063A1 Disjoint Path Computation Algorithm Public/Granted day:2012-08-23
Information query