Compressed Routing Header With Variable-Length Segment Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Segment routing is inefficient due to significant processing, memory, and network resource consumption when using ASICs to copy long lists of IP addresses, especially in scenarios requiring specific paths through a network.
Innovation Solution
Implementing a compressed routing header (CRH) that uses segment identifiers (SIDs) of variable lengths, allowing nodes to reference segment translation tables for pre-defined paths, reducing the need for full IP addresses in each hop, and updating destination addresses to enhance security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If segment routing uses full IP addresses in routing headers, then routing precision is improved, but packet length and processing overhead increase
Solution Approach 1:
The patent applies segmentation by dividing the routing header into multiple segments, where each segment contains a compressed identifier (CID) instead of a full IP address. The routing path is segmented into discrete hops, each identified by a compact CID that references a pre-configured segment translation table at each node. This segmentation allows the routing information to be distributed across multiple compact units rather than requiring one large header, thereby reducing overall packet length while maintaining routing precision through the segmented path specification.
Solution Approach 2:
The patent changes the parameter representation from full IP addresses (32 or 64 bits) to compressed identifiers (CIDs) of variable length (8-64 bits). This parameter transformation is achieved by mapping full IP addresses to shorter CID values at the source node, and then translating these CIDs back to IP addresses at each routing hop using segment translation tables. This parameter change significantly reduces the space required for routing information while preserving the ability to precisely identify routing targets.
2Measurement precision
If segment routing uses full IP addresses, then routing accuracy is improved, but processing resources and memory consumption increase
Solution Approach 1:
The patent employs copying by creating and distributing segment translation tables that map compressed identifiers to full IP addresses at each routing node. Instead of each node processing and storing complete routing paths for all possible destinations, the system copies and stores only the necessary translation mappings locally. This allows intermediate nodes to quickly translate CIDs to next-hop IP addresses without handling full routing tables, significantly reducing memory consumption and processing overhead while maintaining routing accuracy.
Solution Approach 2:
The patent applies preliminary action by pre-configuring segment translation tables at each routing node before actual packet forwarding occurs. The source node also performs preliminary compression of the routing path into CIDs before packet transmission. This preliminary preparation eliminates the need for real-time computation of routing paths and address translations during packet forwarding, reducing processing resources required at each hop while ensuring accurate routing through pre-computed path information.
3Quantity of substance
If compressed routing header uses variable length SIDs, then resource efficiency is improved, but header complexity increases
Solution Approach 1:
The patent applies dynamics by implementing variable-length compressed identifiers (CIDs) in the routing header, where the length of each CID can dynamically adjust between 8 and 64 bits based on the specific routing requirements. This dynamic structure allows the header to be compact for simple routes while accommodating more complex routing scenarios when necessary. The variable length capability is managed through dynamic field width specifications in the header format, allowing routers to efficiently parse and process headers of varying sizes without requiring fixed-length processing logic.
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
A node receives an internet protocol (IP) payload packet that includes an IPv6 transport header that has been extended with a compressed routing header (CRH). The CRH includes a list of segment identifiers (SIDs) that identify nodes that the IP payload packet is to traverse. The node determines, by referencing the list of SIDs, a next segment for the IP payload packet. The node updates a destination IP address that is included in the IPv6 transport header to a particular destination IP address of a next-hop node. The node updates a remaining segments value, included in the CRH, that identifies a number of segments left in a route of the IP payload packet. The node provides the IP payload packet to the next-hop node to allow the next-hop node to route the IP payload packet to another node in the network or to a destination device.