Segmented Traffic Engineering Path Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current path computation elements in networks do not effectively differentiate between the diverse architectures and capabilities of different network portions, leading to inefficient traffic engineering and increased delay, especially when calculating paths that traverse multiple network segments with varying requirements.
Innovation Solution
A path computation element that receives a traffic engineered path expression with segments containing instructions, terminators, and quantifications, allowing it to calculate and optimize paths based on specific network portions, perform label stack reduction, and apply different traffic engineering criteria to each segment, such as bandwidth and delay requirements, to ensure efficient path computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If end to end metrics are used for path computations independent of network portion characteristics, then path computation is simplified, but traffic engineering efficiency deteriorates and delay increases
Solution Approach 1:
The patent segments the path expression into multiple segments, where each segment corresponds to a specific network portion or domain. Each segment can have its own traffic engineering parameters and constraints, allowing differentiated handling of different network portions while maintaining overall path computation coherence.
Solution Approach 2:
The patent applies local quality by allowing different segments of the path to have different traffic engineering characteristics and requirements. Each segment can be optimized independently based on the specific characteristics of the network portion it represents, rather than applying uniform end-to-end metrics throughout the entire path.
2Ease of operation
If uniform path computation is applied across all network portions, then computation process is simpler, but network capabilities and architectures are not properly utilized
Solution Approach 1:
The patent creates a universal path expression framework that can accommodate multiple network portion types and capabilities. The segmented path expression structure allows the same computation mechanism to handle diverse network architectures and capabilities by applying appropriate segment-specific constraints and parameters to each portion.
3Speed
If path computation does not differentiate between network portions, then computation is faster, but delay increases due to inefficient routing
Solution Approach 1:
The patent performs preliminary action by pre-defining path segments with their specific traffic engineering parameters and constraints before actual path computation. This allows the computation element to quickly match requested paths against pre-segmented network portions, maintaining fast computation while ensuring optimal routing that minimizes delay.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Various embodiments relate to a path computation element configured to calculate a path through a network, including: at least one processor; and at least one memory storing instructions, that when executed by the at least one processor, cause the path computation element at least to: receive a TE path expression including a plurality of segments; calculate first portion of the path through the network based upon a first segment of the plurality of segments of the TE path expression; determine if the calculated path has reached its end point; calculate a next portion of the path through the network based upon a next segment of the plurality of segments of the TE path expression when the calculated path has not reached its end point; and perform post processing on the calculated path based upon the received TE path expression when the calculated path has reached its end point.