Segment Routing Traffic Engineering Algorithm Advertisement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current segment routing traffic engineering (SR-TE) algorithms often result in sub-optimal forwarding paths due to limited support for various network constraints, leading to resource wastage and potential quality of service (QoS) violations.
Innovation Solution
Implementing a network with multiple SR-TE algorithms, where each device maintains a data structure to identify supported algorithms and generates advertisement packets with unique identification values to determine optimal forwarding paths based on specific constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a single default SR-TE algorithm is used for routing, then device complexity is reduced and ease of operation is improved, but routing flexibility and QoS compliance deteriorate leading to sub-optimal paths
Solution Approach 1:
The system dynamically selects among multiple SR-TE algorithms based on real-time network conditions and constraints. Network devices maintain a data structure containing identifiers for multiple supported algorithms and can switch between them to satisfy different QoS requirements, transforming the static single-algorithm approach into a dynamic multi-algorithm selection mechanism.
Solution Approach 2:
The invention changes the parameter of algorithm selection by introducing multiple SR-TE algorithms with different characteristics. Each algorithm can be optimized for specific constraints (bandwidth, delay, jitter, etc.), and the system selects the appropriate algorithm by changing the operational parameter from a fixed default to a variable choice among multiple options.
2Adaptability or versatility
If multiple SR-TE algorithms are supported across the network, then routing flexibility and QoS compliance are improved, but device complexity and information overhead increase
Solution Approach 1:
The system segments the algorithm selection process by dividing network devices into different groups based on their supported SR-TE algorithms. Each device maintains a data structure with identifiers for the algorithms it supports, allowing the network to be segmented into capability-based groups. This segmentation reduces individual device complexity while enabling global flexibility.
Solution Approach 2:
The invention implements a universal advertisement mechanism that works across all network devices regardless of which specific SR-TE algorithms they support. The advertisement packet structure and processing logic are universal, while the specific algorithm capabilities vary by device. This multi-functionality approach allows the system to support multiple algorithms without proportionally increasing complexity at each device.
3Adaptability or versatility
If algorithm support information is advertised across the network, then routing flexibility is improved, but communication overhead and processing time increase
Solution Approach 1:
Network devices perform preliminary action by maintaining ready-to-use data structures that contain identifiers for supported SR-TE algorithms. The advertisement information is prepared in advance and can be quickly exchanged when needed, rather than computing or determining algorithm capabilities at the moment of routing decision. This preliminary preparation reduces processing time during actual routing operations.
Data Source
AI summary
In some implementations, a network device may identify a segment routing traffic engineering (SR-TE) algorithm supported by the network device. The network device may determine, based on identifying the SR-TE algorithm, an identification value associated with the network device. The network device may generate an advertisement packet that includes the identification value and information identifying the SR-TE algorithm. The network device may send the advertisement packet to another network device to cause the other network device to update a data structure to indicate that the network device supports the SR-TE algorithm and that the network device is associated with the identification value. The other network device may determine, using the SR-TE algorithm, a forwarding path for a data packet that indicates the network device as a hop in the forwarding path.