BGP Edge Node Path Selection via Precomputed Algorithm Requirements
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional MPLS segment routing and SRv6 technologies have limited flexibility in determining next hops on a BGP forwarding path, relying on default route calculation methods like path-vector routing protocols.
Innovation Solution
A routing control method and apparatus that allow a first edge routing node to determine forwarding path information for a data packet based on a specified requirement for the BGP forwarding path, using a BGP control packet that includes a node identifier and algorithm information to indicate the requirement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If default BGP route calculation manner is used to determine next hops, then routing stability is maintained, but forwarding path flexibility deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing multiple candidate forwarding paths with different algorithm characteristics (e.g., different hop counts, latencies, costs) before actual data packet transmission. When a data packet arrives, the corresponding pre-calculated path is selected based on the packet's requirements, avoiding real-time complex calculations and enabling flexible path selection without increasing runtime computational complexity.
2Adaptability or versatility
If multiple path calculation algorithms are implemented for different requirements, then forwarding path adaptability is improved, but device complexity increases
Solution Approach 1:
The patent implements preliminary action by pre-computing multiple candidate paths using different path calculation algorithms (e.g., shortest path, minimum latency, minimum cost) and storing them in advance. Each candidate path is associated with its calculation algorithm characteristics. During data packet forwarding, the system selects the appropriate pre-calculated path based on the packet's algorithm requirements, thereby achieving multi-algorithm support without executing complex calculations in real-time.
3Productivity
If all next hops are determined by default BGP route calculation, then routing stability is maintained, but computational workload for path optimization increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating multiple candidate forwarding paths using different path calculation algorithms (e.g., shortest path, minimum latency, minimum cost) and storing them in advance. When a data packet arrives, the corresponding pre-calculated path is selected based on the packet's algorithm requirements, avoiding real-time complex calculations and enabling flexible path selection without increasing runtime computational complexity.
Solution Approach 2:
The patent implements dynamics by dynamically selecting among multiple pre-calculated candidate paths based on the specific algorithm requirements of each data packet. The system maintains a pool of pre-computed paths with different characteristics (hop count, latency, cost) and flexibly chooses the most appropriate path for each packet, enabling adaptive forwarding without real-time recalculation.
Data Source
AI summary
A routing control method and apparatus includes receiving, by a first edge routing node, a BGP control packet, where the BGP control packet carries a first node identifier and first algorithm information, where the first node identifier indicates an SID of a destination routing node on a BGP forwarding path, where the first algorithm information indicates a requirement of the BGP forwarding path, where the first edge routing node belongs to a first AS and the destination routing node belongs to a second AS; determining, by the first edge routing node, forwarding path information of the data packet based on the first node identifier and the first algorithm information in the BGP control packet; and forwarding, by the first edge routing node, the data packet based on the forwarding path information.