发明名称 Disjoint Path Computation Algorithm
摘要 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.
申请公布号 US2012213063(A1) 申请公布日期 2012.08.23
申请号 US201213457192 申请日期 2012.04.26
申请人 LU WENHU;KINI SRIGANESH;TELEFONAKTIEBOLAGET L M ERICSSON 发明人 LU WENHU;KINI SRIGANESH
分类号 H04L12/24 主分类号 H04L12/24
代理机构 代理人
主权项
地址