Hop Constrained Maximum Flow Segment Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Shortest path routing in telecommunications networks lacks flexibility in rerouting traffic when demand exceeds expectations and restricts fine-grained control over paths, limiting the ability to utilize available bandwidth and route traffic through middle boxes like load balancers and firewalls.
Innovation Solution
Implementing segment routing with a method to determine a maximum flow on a network path by establishing a segment graph, computing dual weights, finding a minimum dual weight path with a predetermined number of hops, augmenting flow on the path, and updating dual weights, which allows for flexible routing and efficient bandwidth utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If shortest path routing is used, then loop-free delivery of packets is ensured, but traffic cannot be shifted along alternate paths even when spare bandwidth is available
Solution Approach 1:
The patent applies segmentation by dividing the routing path into multiple segments or segments with different weights. Instead of treating the entire path as a single shortest path, the routing is segmented into multiple alternatives, allowing traffic to be distributed across different segments based on bandwidth availability and policy requirements while maintaining loop-free delivery guarantees.
2Device complexity
If shortest path routing is used, then routing is simplified, but fine-grained control on paths cannot be exerted
Solution Approach 1:
The patent implements local quality by assigning different weights to different segments or portions of the routing path. This allows fine-grained control over specific path segments while maintaining overall routing simplicity. Operators can adjust weights locally on particular segments to achieve desired traffic engineering goals without complicating the entire routing system.
3Productivity
If traffic is routed strictly on shortest path, then routing efficiency is maximized, but ability to route through middle boxes like load balancers and firewalls is restricted
Solution Approach 1:
The patent introduces intermediary nodes or middle boxes (such as load balancers and firewalls) as deliberate waypoints in the routing path. By assigning appropriate weights to segments passing through these intermediaries, the system can route traffic through required middle boxes while maintaining routing efficiency. The intermediary elements act as controlled points where traffic can be inspected, balanced, or filtered without completely disrupting the efficient shortest-path-based routing framework.
Data Source
AI summary
A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.