SRv6 Virtual Path Planning for Shorter Segment Routing Headers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There are few alternative manners of planning a path by a controller in SRv6 network forwarding, limiting the flexibility and efficiency of data transmission.
Innovation Solution
A path planning method that involves determining a transmission parameter condition for a to-be-planned path between a head node and a tail node, searching for a target virtual path whose transmission parameter meets the condition, and sending path planning information to the head node to indicate labels and sequence of nodes on the target virtual path, thereby enriching path planning options.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a controller plans a path based on physical paths between nodes in SRv6, then the path planning is straightforward, but the number of alternative path planning manners is limited
Solution Approach 1:
The patent segments the physical network into multiple virtual paths between node pairs, where each virtual path represents a distinct transmission option with its own characteristics. This segmentation allows the controller to select from multiple virtual paths rather than being constrained to single physical paths, thereby enriching path planning manners while maintaining manageable complexity through structured virtual path management
Solution Approach 2:
The patent introduces a virtual path dimension overlaying the physical network topology. By creating virtual paths that may combine, split, or reroute differently than physical connections, the system adds an additional planning dimension. This allows the controller to select virtual paths based on transmission parameters without fundamentally complicating the underlying physical network structure
2Reliability
If the path includes more nodes, then more transmission parameter conditions can be satisfied, but the Segment Routing Header becomes longer and data packet load rate decreases
Solution Approach 1:
The patent changes the selection criterion from minimizing node count to optimizing transmission parameters. By evaluating virtual paths based on transmission parameters (such as bandwidth, delay, or reliability metrics) rather than simply counting nodes, the system can select paths that satisfy transmission conditions while potentially using fewer nodes, thus keeping SRH length manageable while ensuring reliability requirements are met
3Productivity
If the controller searches for optimal paths using traditional methods, then the path planning is simple, but the flexibility and efficiency of data transmission are limited
Solution Approach 1:
The patent performs preliminary action by pre-establishing multiple virtual paths between node pairs and characterizing them with transmission parameters before actual data transmission. This advance preparation allows the controller to quickly select appropriate paths based on current transmission requirements without performing complex real-time calculations, thereby improving data transmission efficiency while the apparent complexity is managed through pre-computation
Data Source
Figure 1~2
Figure 3
Figure 4~5
AI summary
This application discloses a path planning method and apparatus, and a data transmission system, and belongs to the field of communication technologies. The method includes: determining a transmission parameter condition of a to-be-planned path between a head node and a tail node of a flow; searching for a target virtual path whose transmission parameter meets the transmission parameter condition in at least one virtual path between the head node and the tail node, where a transmission parameter of the virtual path is a transmission parameter of a physical path corresponding to the virtual path, and each node on the virtual path is located on the corresponding physical path; and sending path planning information to the head node, where the path planning information is used to indicate labels and a sequence of nodes on the target virtual path. This application resolves a problem that there are few alternative manners of planning a path by a controller currently, and enriches path planning manners. This application is used for path planning.