SID List Compression Using Mixed Flex-Algo Topologies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing Segment Routing (SR) technologies face challenges in efficiently compressing Segment Identifier (SID) lists while ensuring that the computed path remains unchanged, particularly in scenarios involving Flexible Algorithm (Flex-Algo) topologies, due to hardware limitations on segment depth and the need for optimized traffic engineering.
Innovation Solution
The approach allows mixing and matching of SIDs from different Flex-Algo topologies to minimize segment list depth by selecting node SIDs independently during iterations, using a greedy or thorough algorithm to ensure the computed path is maintained with minimal segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If SID list compression is applied to reduce segment depth, then hardware limitation compliance is improved, but the complexity of selecting SIDs from multiple Flex-Algo topologies increases
Solution Approach 1:
The patent segments the SID selection process into independent iterations for each segment position, where each iteration independently selects the optimal SID from available Flex-Algo topologies. This segmentation allows the system to handle the complexity of multiple topologies through a structured, step-by-approach rather than requiring complex global optimization
Solution Approach 2:
The patent introduces dynamic selection of SIDs based on current compression state and available topologies. The algorithm dynamically adapts by evaluating which Flex-Algo topology provides the best compression opportunity at each iteration, making the selection process flexible rather than static
2Productivity
If multiple Flex-Algo topologies are utilized for SID selection, then SID list compression efficiency is improved, but the difficulty of ensuring path fidelity increases
Solution Approach 1:
The patent implements feedback mechanisms where each SID selection is validated against the original calculated path. The system continuously monitors whether selected SIDs maintain path fidelity, using this feedback to adjust subsequent selections and ensure the compressed segment list remains faithful to the original path
Solution Approach 2:
The patent performs preliminary validation of candidate SIDs before final selection, checking whether each potential SID maintains path fidelity with the original calculated path. This preliminary action prevents selection of SIDs that would deviate from the intended path, simplifying the verification process
Data Source
AI summary
Segment Identifier (SID) list compression includes receiving a calculated path in a Segment Routing network from a headend node to an end node; utilizing a compression approach to determine a segment list that, when expanded, matches the calculated path, wherein each segment in the segment list is identified by a SID, and wherein the SID is selected from any of a base topology in the Segment Routing network and any Flexible Algorithm (Flex-Algo) topologies in the Segment Routing network; and providing the segment list to the headend node. The SID list compression can further include, prior to the receiving, calculating the calculated path from the headend node to the end node based one or more constraints, wherein the SIDs are selected after the calculated path is determined without regard to any purpose of the any Flex-Algo topologies.