Segment Routing Path Database for Unique Path Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems face inefficiencies due to the concurrent combination of path and policy determinations, leading to redundant calculations, resource wastage, and potential system failures under high traffic conditions.
Innovation Solution
The system separates path determination from policy decisions, allowing for independent assessment of unique paths chosen by each policy. This separation enables the storage of unique paths in a database, facilitating the computation of best paths based on predicted performance metrics and health scores.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If path and policy determinations are made concurrently, then routing decisions can be made quickly, but redundant calculations occur and resources are wasted
Solution Approach 1:
The patent segments the routing decision process into two independent parts: path determination (computing possible paths) and policy determination (selecting the best path). This segmentation allows the system to compute paths once and reuse them across multiple policies, eliminating redundant calculations while maintaining fast routing decisions.
Solution Approach 2:
The system performs path determination in advance, before policy selection is needed. By pre-computing available paths and storing them for reuse, the system avoids re-computing the same paths for different policies, thereby reducing computational resource waste while enabling rapid routing decisions.
2Reliability
If multiple policies independently determine paths, then each policy gets optimal routing, but the same path is selected multiple times causing cyclic degradation
Solution Approach 1:
The patent merges the path determination function into a shared resource that all policies can access. Instead of each policy independently determining paths, the system computes paths once and makes them available to all policies, ensuring path uniqueness while maintaining routing optimality through shared path information.
Solution Approach 2:
The system introduces an intermediary path determination layer between multiple policies and the network paths. This intermediary computes paths once and provides them to all policies, preventing cyclic degradation caused by multiple independent path determinations while ensuring each policy receives optimal routing information.
3Adaptability or versatility
If path determination is performed for each policy independently, then policy-specific optimization is achieved, but device complexity increases
Solution Approach 1:
The system segments the routing architecture into a shared path determination component and multiple policy determination components. This segmentation allows policy-specific optimization to occur at the policy level while the path determination logic remains centralized and reusable, reducing overall system complexity.
Solution Approach 2:
The path determination component is designed as a universal, multi-functional element that serves all policies. By making the path determination logic reusable across multiple policies rather than duplicating it for each policy, the system maintains policy-specific optimization capabilities while reducing device complexity through shared functionality.
Data Source
AI summary
Discussed are systems, methods and computer readable media that use a segment routing system and compute a path for network traffic based on segment routing policies. Based on these computations, the system is able to determine a path, and if the path is unique. When the path is unique it is stored in a path database which includes the unique paths available to the segment routing system. Based on the path database and segment routing polices, the system will compute a best path from the available unique paths for the network traffic based on measured and predicted performance metrics of the unique paths.