SDN Controller Path Selection for Network Bandwidth Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network bandwidth optimization techniques, such as cost-based shortest path algorithms, often lead to link congestion and underutilization of other paths, and resource reservation protocols increase complexity and fail to address network-wide bandwidth fragmentation.
Innovation Solution
A centralized SDN controller calculates projected utilization for each path between a source and destination, assigning flows to paths that keep utilization below a target threshold, minimizing congestion and fragmentation by dynamically reallocating existing flows as needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If cost-based shortest path algorithms are used for path selection, then path selection is simple and fast, but link congestion occurs and other paths remain underutilized
Solution Approach 1:
The patent implements dynamic path selection by continuously monitoring link utilization metrics and adjusting flow paths in real-time. The controller dynamically recalculates paths based on current network conditions, transitioning from static shortest path algorithms to dynamic optimization that responds to changing bandwidth availability and congestion states.
Solution Approach 2:
The patent changes the path selection parameters from simple cost metrics to composite parameters including bandwidth availability, link utilization rates, and quality of service metrics. This parameter transformation enables the system to optimize for both simplicity and utilization by weighing multiple factors in the path selection decision.
2Reliability
If resource reservation protocols like RSVP-TE are used, then link congestion is mitigated, but deployment and operational complexity increases
Solution Approach 1:
The patent extracts the path selection and bandwidth optimization functions from complex resource reservation protocols and implements them as independent SDN controller capabilities. By separating these functions, the system achieves congestion mitigation without requiring the complex hop-by-hop signaling and admission control mechanisms of RSVP-TE.
Solution Approach 2:
The SDN controller acts as an intermediary between flow requests and network resources, centralizing the optimization logic. This intermediary approach replaces the distributed complexity of resource reservation protocols with a centralized intelligence that makes optimal path selection decisions based on global network state information.
3Ease of operation
If distributed resource reservation protocols are used, then per-flow bandwidth control is achieved, but network-wide bandwidth fragmentation is not addressed
Solution Approach 1:
The patent merges per-flow bandwidth control with network-wide optimization by having the SDN controller consider aggregate bandwidth availability across the entire network when selecting paths. This combination allows the system to simultaneously control individual flow bandwidth while preventing fragmentation at the network level through holistic path selection.
Solution Approach 2:
The controller performs preliminary analysis of network bandwidth distribution and reservation status before admitting new flows. By proactively assessing the impact of potential path selections on overall bandwidth fragmentation, the system prevents fragmentation issues before they arise rather than reacting to them after they occur.
Data Source
AI summary
Techniques for end-to-end network bandwidth optimization using software defined networking are provided. In one embodiment, a computer system can receive information regarding a flow to be admitted to a network, where the flow is associated with a source and a destination. The computer system can further calculate, for each path in a plurality of paths between the source and the destination, a projected utilization of the path in view of the flow. If the projected utilization of the shortest path in the plurality of paths is less than or equal to a target utilization threshold, the computer system can assign the flow to the shortest path. Otherwise, the computer system can select a path in the plurality of paths that comes closest to the target utilization threshold without exceeding the threshold and can assign the flow to that selected path.