SRv6 Packet Replication Using Node Lists to Cut SID Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing packet transmission methods in communication networks, particularly in segment routing over internet protocol version 6 (SRv6), suffer from complex encoding structures and high overheads due to nested encoding of segment identifiers (SIDs) for replication nodes and sub-trees, leading to low transmission efficiency.
Innovation Solution
A packet transmission method that utilizes a node information list carried in the packet, with a pointer to identify next packet processing devices, allowing for efficient generation and transmission of packets to specific devices, reducing overheads and improving efficiency by optimizing SID encoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If nested SIDs are used for encoding in segment routing, then packet transmission can be achieved, but encoding structure becomes complex and overheads increase
Solution Approach 1:
The patent segments the complex nested SID encoding into separate components: a base SID for the replication node and separate sub-tree SID lists for each branch. This segmentation eliminates the nested structure, simplifying the encoding while maintaining the ability to route packets through multiple replication nodes efficiently.
Solution Approach 2:
The patent extracts the sub-tree SID information from the nested SID structure and places it in separate dedicated fields. By taking out the sub-tree SIDs from the nested encoding, the patent simplifies the overall encoding structure while preserving all necessary routing information for multi-branch replication.
2Reliability
If each node processes SIDs after packet replication, then routing can be maintained, but transmission overheads become excessively high
Solution Approach 1:
The patent performs preliminary action by pre-calculating and embedding all necessary sub-tree SID information into the packet header before transmission. This allows intermediate nodes to forward packets without processing or modifying SID information, significantly reducing transmission overhead while maintaining routing accuracy through the pre-configured SID structure.
3Loss of information
If nested encoding is used for replication nodes and sub-trees, then complete routing information is provided, but transmission efficiency decreases
Solution Approach 1:
The patent applies local quality by providing different types of routing information in different fields: base SID for the replication node and separate sub-tree SID lists for each branch. This localized organization ensures complete routing information is available while enabling efficient processing, as each field contains only the specific information needed for its corresponding routing function.
Data Source
AI summary
A packet transmission method, apparatus, device, and system, and a storage medium are provided. The method includes: A first device obtains a first packet, and determines node information of a second device and node information of a third device from a node information list of the first packet by using a first part included in a destination address field of the first packet. The first device generates, based on the first packet, a second packet including the node information of the second device and a third packet including the node information of the third device. The first device sends the second packet to the second device, and sends the third packet to the third device.