Dynamic Flow Load Balancing Across Shortest and Alternative Network Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional best-path routing strategies, such as ECMP, inefficiently use network resources by not considering non-shortest paths for traffic routing, leading to saturation issues when shortest paths become congested, preventing reliable data transmission even if unsaturated longer paths exist.
Innovation Solution
Implement dynamic load balancing by allocating network traffic among both preferred (shortest) and alternative (longer) paths based on real-time traffic information, classifying packets into flows, and assigning them to either preferred or alternative paths based on latency tolerance and congestion levels, allowing efficient use of network resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If only shortest paths are used for routing (ECMP strategy), then routing simplicity and speed are improved, but network resource utilization deteriorates because non-shortest paths remain idle
Solution Approach 1:
The patent implements dynamic load balancing that adapts path selection based on real-time network conditions. The system monitors traffic loads on shortest paths and dynamically redirects flows to alternative non-shortest paths when congestion is detected, making the routing strategy flexible rather than static. This resolves the contradiction by maintaining routing simplicity through automated dynamic adjustment while improving resource utilization by actively using alternative paths.
Solution Approach 2:
The system changes the routing parameter from fixed shortest-path selection to dynamic path selection based on traffic load parameters. By monitoring traffic volume and dynamically adjusting path selection, the system transforms the rigid ECMP approach into a flexible system that can utilize non-shortest paths when needed, thereby improving network resource utilization without compromising routing simplicity.
2Speed
If traffic is load-balanced only among shortest paths, then routing efficiency is improved, but reliability deteriorates when shortest paths become saturated
Solution Approach 1:
The patent prepares alternative non-shortest paths in advance as backup routes before congestion occurs. The system maintains knowledge of these alternative paths and can quickly switch to them when shortest paths become saturated, providing a cushion against potential transmission failures. This resolves the contradiction by maintaining routing efficiency through primary use of shortest paths while ensuring reliability through pre-prepared alternative routes.
Solution Approach 2:
The system introduces an intermediary monitoring and control mechanism that observes traffic conditions on shortest paths and mediates flow redirection to alternative paths when necessary. This intermediary layer enables the system to maintain routing efficiency by default while providing reliability assurance through automated failover, resolving the contradiction between speed and reliability.
3Device complexity
If alternative non-shortest paths are excluded from routing, then path selection complexity is reduced, but network capacity utilization deteriorates
Solution Approach 1:
The patent implements a self-service routing system that automatically monitors network conditions and makes intelligent decisions about flow redirection without complex manual configuration. The system autonomously determines when to use alternative paths based on traffic load, eliminating the need for complex manual path selection mechanisms while improving capacity utilization. This resolves the contradiction by maintaining simple automated decision-making while actively utilizing alternative paths to boost network productivity.
Data Source
AI summary
Exemplary embodiments allocate network traffic among multiple paths in a network, which may include one or more preferred paths (e.g. shortest paths) and one or more alternative paths (e.g., non-shortest paths). In one embodiment, network traffic in form of flows may be allocated to the preferred paths until the allocation of additional network traffic would exceed a predetermined data rate. Additional flows may then be sent over the alternative paths, which may be longer than the preferred path. The paths to which each flow is assigned may be dynamically updated, and in some embodiments the path assignment for a particular flow may time out after a predetermined time. Accordingly, the flow traffic of each path may be balanced based on real-time traffic information.