Feedback-Based Flow Remapping for Network Congestion Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network congestion occurs due to multiple flows colliding and using the same paths through the network, leading to oversubscription and delays.
Innovation Solution
The system identifies congested links and selects a flow to be remapped, transitioning it from one path to another by modifying packet headers and performing hash operations to index new paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If multiple flows use the same path through the network, then routing simplicity is maintained, but network congestion and packet delays occur
Solution Approach 1:
The patent implements dynamic flow remapping where flows are reassigned to different paths based on real-time network congestion conditions. The system monitors link utilization and dynamically adjusts flow paths, transitioning from static routing to adaptive routing that responds to changing network states, thereby maintaining routing simplicity while avoiding congestion.
Solution Approach 2:
The system employs feedback mechanisms by monitoring network congestion levels and using this information to make remapping decisions. Congestion metrics from the network are fed back to the remapping logic, which then adjusts flow assignments accordingly. This closed-loop control enables the system to maintain optimal throughput while preserving routing simplicity through automated adaptation.
2Productivity
If flows are remapped to different paths, then network congestion is reduced, but packet ordering issues and flow state inconsistencies occur
Solution Approach 1:
The patent segments flows into smaller sub-flows or micro-flows that can be independently routed. By dividing a flow into multiple segments that can take different paths and then reassembling them at the destination, the system achieves load balancing while managing packet ordering through segmentation and reassembly protocols, thereby maintaining reliability during remapping.
Solution Approach 2:
The system changes routing parameters dynamically by modifying flow assignment parameters based on congestion conditions. When remapping occurs, parameters such as path selection, hop counts, and routing metrics are adjusted to ensure that packet delivery consistency is maintained while achieving congestion reduction. This controlled parameter change enables flexible routing without compromising reliability.
3Productivity
If flow remapping is performed frequently, then congestion avoidance is improved, but network overhead and processing complexity increase
Solution Approach 1:
The patent implements periodic remapping where flows are reassigned at predetermined intervals or when congestion thresholds are met, rather than continuously or excessively frequently. This periodic approach balances congestion avoidance with processing overhead by performing remapping operations only when necessary, reducing unnecessary processing complexity while maintaining effective congestion management.
Solution Approach 2:
The system discards ineffective or suboptimal flow paths and recovers computational resources for more valuable remapping operations. By eliminating redundant remapping attempts and focusing processing on high-impact flow assignments, the system reduces processing complexity while maintaining effective congestion avoidance through selective, purposeful remapping actions.
Data Source
AI summary
Techniques and algorithms for monitoring network congestion and for triggering a flow to follow a new path through a network. The network is monitored, and network feedback data is acquired, where that data indicates whether the network is congested. If the network is congested, a feedback-driven algorithm can trigger a flow to follow a new path. By triggering the flow to follow the new path, congestion in the network is reduced. To identify congestion, the feedback data is analyzed to determine whether flows are colliding. The feedback-driven algorithm determines that a network remapping event is to occur in an attempt to alleviate the congestion. A flow is then selected to be remapped to alleviate the congestion.


