Method for recovering inter-domain failure of cross-domain label switched path
A label switching path and recovery method technology, which is applied to data switching networks, digital transmission systems, electrical components, etc., can solve the problems of long recovery time, long calculation time, and conflicts of cross-domain label switching paths
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0047] In this embodiment, as an improvement of the present invention:
[0048] In step (2), the path calculation unit PCE(i) of domain D(i) is set with forward recovery threshold Hf and reverse recovery threshold Hb; the virtual recovery path tree VRPT(i) calculation of domain D(i) fails When , the LSP cross-domain restoration request message sent forward by the path computation unit PCE(i) to the path computation unit PCE(i+1) of domain D(i+1) also includes the forward restoration threshold Hf; the virtual restoration path The tree VRPT(i) is successfully calculated, and the path computation unit PCE(i) sends the LSP cross-domain restoration request message to the path computation unit PCE(i-1) in domain D(i-1) in reverse, which also includes the reverse restoration threshold Hb ;
[0049] In step (3), after the path computation unit PCE(i+1) of the domain D(i+1) receives the LSP cross-domain restoration request message sent by the path computation unit PCE(i) of the domain...
example 1
[0066] Assuming that node 13 fails, it is obviously not feasible to recover the failed cross-domain label switching path LSP in domain D(3), and it is necessary to perform cross-domain recovery for the failed cross-domain label switching path LSP. The process of restoring a valid inter-domain label switching path LSP across domains is as follows: Figure 7 As shown, the specific steps are as follows:
[0067] (1) The path calculation unit PCE (3) sets the restoration threshold, for example, sets the forward restoration threshold Hf=1, and the reverse restoration threshold Hb=2. The path calculation unit PCE (3) respectively calculates the shortest paths from all the entry boundary nodes in the domain D (3) excluding the failure node 13 to the path exit boundary node BNex (3). In this example, the entry boundary node of domain D (3) is node 12 after excluding the failure node 13, and a node 12 is obtained to the path exit boundary node BNex (3), that is, the virtual recovery p...
example 2
[0074] In the fault scenario of Example 1, only the reverse recovery threshold Hf is needed, and the recovery method of the present invention is described below in a scenario where the forward recovery threshold Hb is required.
[0075] Such as Figure 8 As shown, assuming that node 17 fails, it is obviously not feasible to restore this failed cross-domain label switching path LSP in domain D(3), and cross-domain recovery is required. The specific steps are as follows:
[0076] (1) The path calculation unit PCE (3) sets recovery thresholds: forward recovery threshold Hf=1, reverse recovery threshold Hb=2. After the path calculation unit PCE (3) excludes the failure node 17, it calculates the virtual recovery path VSPT (3). In this topology, since the failure node 17 is the path exit boundary node of domain D(3), there is no path from the entry boundary node to the path exit boundary node BNex(3) in domain D(3), namely the failure node 17, virtual recovery Path tree VSPT(3) c...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 