Cross-Domain Constraint Routing via Border Node Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for cross-domain constraint routing in Multi-Protocol Label Switching Traffic Engineering (MPLS TE) often result in unnecessary path calculations and signaling actions, as they require calculating each segment of the path between the original node and border nodes, or calculating every possible path, leading to inefficiencies.
Innovation Solution
The method involves setting border node identifiers in the ERO sub-objects of the cross-domain constraint route, allowing the original node to determine the first border node and calculate the path to it, with subsequent border nodes determining the next border node and calculating their paths, thereby reducing unnecessary calculations and signaling by only considering border nodes for path establishment.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional cross-domain constraint routing methods are used to calculate each segment of the path between original node and border nodes, then complete routing paths can be established, but unnecessary path calculations and signaling actions occur, reducing routing efficiency
Solution Approach 1:
The patent extracts and removes unnecessary path calculation segments from the routing process. By identifying that only paths between border nodes need to be calculated (而非 every segment between original node and border nodes), the invention eliminates redundant calculations while maintaining complete routing establishment.
Solution Approach 2:
The patent segments the routing calculation process into essential and non-essential parts. It divides the path calculation into only those segments between border nodes that are necessary for cross-domain routing, separating them from unnecessary intra-domain segments that can be handled differently or omitted.
2Reliability
If all possible paths are calculated to ensure routing completeness, then reliable route establishment is achieved, but excessive computational resources and time are consumed
Solution Approach 1:
The patent extracts only the necessary path calculations between border nodes, removing the requirement to calculate all possible paths within domains. This selective extraction maintains route establishment reliability while dramatically reducing computational time and resources.
Solution Approach 2:
The patent applies partial action by calculating only the necessary portion of paths (between border nodes) rather than all possible paths. This partial calculation approach is sufficient for cross-domain routing reliability while avoiding excessive computational expenditure.
3Measurement precision
If detailed path calculations are performed for each route segment, then accurate routing information is obtained, but signaling overhead and processing complexity increase
Solution Approach 1:
The patent extracts and removes unnecessary detailed path calculations for intra-domain segments, keeping only the essential inter-domain path calculations between border nodes. This reduces signaling overhead and processing complexity while maintaining sufficient routing information accuracy for cross-domain routing.
Data Source
AI summary
The present invention discloses a method for implementing cross-domain constraint routing, through setting in addition the border node identifier in the ERO sub-objects saved in ERO corresponding to nodes that a route will pass, this invention realizes the distributed calculation of the route. When calculating the path of cross-domain constraint routing, the original node determines the first border node that the route will pass based on the border node identifiers set in the ERO sub-objects in ERO, calculates the path to the first border node, and then sends a PATH message; the first border node determines, based on the next ERO sub-object with a border node identifier in the ERO of the received PATH message, the next border node that the route will pass, calculates the path to the further next border node, and then sends the PATH message; . . . Repeat such a process until the PATH message reaches the destination node.