SRv6 Packet Encoding Segmentation for Next-Hop Replication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing packet transmission methods in SRv6 networks face inefficiencies due to complex encoding structures and high overheads, especially when dealing with a large number of next-hop replication nodes, leading to low transmission efficiency.
Innovation Solution
A method that simplifies packet encoding by using a bit string and reference information to quickly determine next-hop devices, allowing for efficient packet replication and forwarding without the need for complex segment lists, thereby reducing processing and transmission overheads.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If nested encoding is used for segment list in SRv6 packet transmission, then packet replication can be achieved, but encoding structure becomes complex and transmission overheads increase
Solution Approach 1:
The patent segments the segment list into multiple separate structures: a first segment list for single-hop next hops and a second segment list for multi-hop next hops. This segmentation eliminates the need for nested encoding while preserving packet replication functionality, directly resolving the contradiction between adaptability and complexity.
Solution Approach 2:
The patent creates simplified copies of routing information in the form of separate segment lists that reference next-hop devices without requiring complex nested structures. Each segment list entry contains essential forwarding information, enabling packet replication through simpler copying operations rather than complex nested decoding.
2Adaptability or versatility
If nested encoding is used for segment list, then packet replication is enabled, but packet transmission overheads become excessively high
Solution Approach 1:
By dividing the routing information into separate segment lists (single-hop and multi-hop), the patent reduces the overhead of transmitting nested encoding structures. Each segment list contains only necessary forwarding information for its specific hop type, eliminating redundant data and reducing overall transmission overhead while maintaining replication capability.
Solution Approach 2:
The patent extracts and separates the nested encoding from the segment list structure, removing the complex nested elements that cause high overhead. The essential routing information is retained in simplified forms that can be transmitted more efficiently, directly reducing transmission overhead while preserving packet replication functionality.
3Adaptability or versatility
If nested encoding is used for segment list, then packet replication can be performed, but transmission efficiency becomes excessively low
Solution Approach 1:
The patent segments routing information into separate segment lists that can be processed independently and more efficiently. This segmentation allows receiving devices to quickly identify and process relevant next-hop information without decoding complex nested structures, significantly improving transmission efficiency while maintaining packet replication capability.
Solution Approach 2:
The patent uses simplified copying mechanisms where segment lists are replicated and distributed to next-hop devices without requiring complex nested decoding operations. This approach enables fast packet replication and forwarding, improving transmission efficiency by eliminating time-consuming nested structure processing.
Data Source
AI summary
This application provides a packet transmission method, apparatus, and device. For example, the method is performed by an ingress node. The ingress node obtains a second packet by using first node information carried in a first packet, where the first node information includes a first bit string indicating N next-hop devices of the ingress node and first reference information used for indexing second node information corresponding to a first intermediate node in the N next-hop devices, and the second packet includes a first identifier determined based on the first reference information. The ingress node sends the second packet to the first intermediate node. Because structures of the first bit string and the first reference information are used, a packet encoding manner is simple, so that packet transmission efficiency is improved.