uSID Carrier Packing for Compressed IPv6 SID Lists
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Segment Routing (SR) networks require multiple headers to encode a SID list, which increases packet size and inefficiently utilizes network resources.
Innovation Solution
A method to compress SID lists by encoding multiple Segment Identifiers (SIDs) into a single IPv6 address using uSID carriers, allowing consecutive SIDs with the same parent node to be packed together, reducing the number of bytes in the packet header while maintaining the same topological and service path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If multiple headers are used to encode the SID list onto a packet, then the SID list can be fully represented, but the packet size increases and network resources are inefficiently utilized
Solution Approach 1:
The patent merges multiple Segment Identifiers (SIDs) into a single compressed SID list structure. Instead of encoding each SID separately in individual headers, the invention combines multiple SIDs into a compact representation that fits within a single header structure, thereby reducing packet size while maintaining complete SID list information.
Solution Approach 2:
The patent changes the encoding parameters of the SID list by introducing a compressed format with modified data structure parameters. The compression technique alters how SIDs are represented, using optimized field widths and packing densities to reduce the total byte count while preserving all necessary routing information.
2Loss of information
If multiple headers are used to encode the SID list, then all SIDs can be included, but network resource utilization becomes inefficient
Solution Approach 1:
The invention merges multiple SID encoding operations into a single compressed header structure. By consolidating what would require multiple separate headers into one optimized header, the patent reduces the total number of processing operations and memory allocations required, thereby improving network resource efficiency while preserving complete SID information.
Solution Approach 2:
The compressed SID list structure serves multiple functions within a single header: it stores multiple SIDs, maintains routing path information, and enables efficient processing. This multi-functional design eliminates the need for multiple specialized headers, optimizing network resource utilization.
3Quantity of substance
If consecutive SIDs with the same parent node are packed together using uSID carriers, then the packet header bytes are reduced, but the encoding complexity increases
Solution Approach 1:
The patent segments the SID list into groups based on parent node identity. Consecutive SIDs sharing the same parent node are identified and packed together into shared carrier structures. This segmentation strategy enables efficient compression by exploiting the hierarchical structure of the routing information, reducing packet header size while managing encoding complexity through systematic grouping.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
In one embodiment, a method includes identifying, by a network component, a first segment identifier (SID) within a SID list. The first SID includes a first SID block and a first micro SID (uSID). The method also includes initializing, by the network component, a packing list of a uSID carrier with the first uSID of the first SID and initializing, by the network component, a packing block of the uSID carrier with the first SID block of the first SID. The method further includes initializing, by the network component, a remaining packing capacity of the packing list with a carrier capacity of the first SID and initializing, by the network component, an empty compressed SID list.