Multi-domain Routing Computation Using Extended BRPC
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-domain networks, the Backward-Recursive PCE-Based Computation (BRPC) algorithm cannot be implemented when there are domains without a Path Computation Element (PCE), leading to suboptimal path computation and efficiency issues due to the requirement for consecutive domains to be deployed with PCEs.
Innovation Solution
The method extends the BRPC algorithm by treating domain topology of domains without a PCE as extended inter-domain links, generating a virtual shortest path tree using Domain to Domain Routing Protocol (DDRP) and combining intra-domain abstract links and inter-domain links to enable path computation between domains with and without PCEs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the BRPC algorithm is used for path computation in multi-domain networks, then path computation efficiency and optimality are improved, but it requires all domains to be deployed with PCEs which increases device complexity and deployment difficulty
Solution Approach 1:
The patent segments the multi-domain network into PCE-deployed domains and non-PCE domains. The BRPC algorithm is applied only to domains with PCEs, while domains without PCEs are handled separately using traditional routing protocols. This segmentation allows the system to benefit from BRPC's efficiency where applicable without requiring universal PCE deployment.
Solution Approach 2:
The patent creates a universal path computation framework that can handle both PCE-deployed and non-PCE domains within the same network. The system automatically selects the appropriate computation method (BRPC or traditional routing) based on domain characteristics, making the solution applicable to diverse network configurations without requiring uniform PCE deployment.
2Ease of operation
If the BRPC algorithm is applied in domains without PCE deployment, then path computation can be performed, but the algorithm cannot be implemented as required leading to suboptimal paths
Solution Approach 1:
The patent introduces boundary nodes as intermediaries between PCE-deployed domains and non-PCE domains. These boundary nodes receive path computation requests, determine the appropriate computation method based on domain characteristics, and coordinate between different computation approaches. This intermediary mechanism enables seamless path computation across domain boundaries while maintaining path optimality where BRPC is applicable.
3Adaptability or versatility
If different path computation methods are used in different domains, then compatibility with various deployment scenarios is improved, but path computation complexity and coordination overhead increase
Solution Approach 1:
The patent applies different path computation methods with local quality - BRPC algorithm is used in domains with PCEs where it can provide optimal performance, while traditional routing protocols are used in domains without PCEs. The boundary nodes automatically select the appropriate method based on local domain characteristics, allowing each domain to operate with the most suitable computation approach for its specific deployment scenario.
Solution Approach 2:
The patent implements dynamic method selection at boundary nodes, which determine in real-time whether to apply BRPC or traditional routing based on the characteristics of the next domain in the path. This dynamic adaptation allows the system to flexibly handle various deployment scenarios without requiring complex pre-configuration or manual intervention for each domain.
Data Source
Figure 1~3
Figure 4~5(a)
Figure 5(b)~5(c)
AI summary
Disclosed is a multi-domain routing computation method, including: when it is determined that there are two or more domains deployed with a Path Computation Elements (PCE) in a network, a routing path is computed, between a PCE of a first domain and a PCE of a last domain among the two or more domains deployed with a PCE, using an extended Backward-Recursive PCE-Based Computation (BRPC) algorithm, and the routing path is computed using a Routing Controller (RC) in domains other than the two or more domains deployed with a PCE. Further disclosed are a multi-domain routing computation device, a path computation element and a routing network. The present disclosure can improve greatly optimality of path computation and has a fairly high efficiency for the path computation.