Communication Node Congestion-Based Routing and Flow Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication networks face challenges in providing Quality of Service (QoS) while efficiently utilizing all available links, as existing solutions either rely on low management burden with no bandwidth guarantees or focus on resource reservation with complex path computation and resource wastage.
Innovation Solution
A communication node that associates packets with a 'remaining value' based on their importance and congestion levels, determining whether to transmit or drop them, and uses feedback mechanisms to balance load across alternative paths, ensuring efficient use of resources and QoS support.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If automatic shortest path routing is used, then management burden is low and delay efficiency is good, but Quality of Service (QoS) measures and bandwidth guarantees are not provided
Solution Approach 1:
The patent implements feedback mechanisms where network nodes report congestion levels and resource availability back to routing entities. This feedback loop enables dynamic adjustment of routes based on current network conditions, allowing the system to maintain low management burden while providing QoS guarantees through real-time information about link capacity and congestion states.
Solution Approach 2:
The routing system transitions from static shortest path selection to dynamic route computation that adapts to changing network conditions. The system continuously updates routing decisions based on current congestion levels, resource availability, and QoS requirements, enabling both ease of operation and reliable QoS provision through adaptive behavior.
2Reliability
If traffic engineering with resource reservation is used, then bandwidth guarantees and QoS measures are provided, but path computation becomes complicated and resources are wasted
Solution Approach 1:
The patent divides the complex routing problem into smaller, manageable segments by computing routes in stages rather than as a single complex computation. The system first identifies candidate paths, then evaluates them against QoS constraints, and finally selects the optimal route. This segmentation reduces computational complexity while maintaining QoS guarantees.
Solution Approach 2:
The system computes routes with sufficient detail to guarantee QoS but avoids unnecessary complexity by focusing only on the essential parameters needed for decision-making. Rather than computing all possible parameters and paths, the system performs partial computation on the most relevant factors, reducing overall complexity while maintaining adequate QoS provision.
3Reliability
If alternative paths are reserved for robustness, then reliability is improved, but network resources are wasted
Solution Approach 1:
The patent implements dynamic path selection where alternative routes are activated based on real-time network conditions rather than being permanently reserved. When primary paths are available and performing well, alternative paths remain dormant, freeing their resources for other uses. When primary paths fail or become congested, alternative paths are dynamically activated, providing robustness without continuous resource consumption.
Solution Approach 2:
The system discards reserved alternative paths when they are not needed, allowing their resources to be recovered and utilized for other purposes. When network conditions change and alternative paths become necessary, the system reactivates them. This approach maintains robustness while minimizing resource waste by only maintaining alternative paths when actually required.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
According to embodiments herein a method in a communication node (10) for handling a packet to a destination node (11) in a communications network (1) is provided. The communication node (10) associates the packet with a remaining value, which remaining value is a packet value reduced by a threshold value of an outgoing link from the communication node (10) towards the destination node (11), which threshold value corresponds to a congestion level of the outgoing link. The communication node (10) further handles the packet based on the remaining value, which handling comprises determining whether to drop or to transmit the packet along the outgoing link based on the remaining value.