Dynamic Bandwidth Allocation for Network Queues
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current packet scheduling systems in network devices are inflexible, leading to unused bandwidth in idle queues while packets may be dropped in queues exceeding their allocated bandwidth, due to a fixed allocation method that does not adapt to changing traffic demands.
Innovation Solution
A network device with configurable mechanisms that track queue usage and dynamically adjust bandwidth allocations proportionally based on predefined thresholds, ensuring fair resource access and minimizing packet drops by recalculating new bandwidth allocations when thresholds are exceeded.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a fixed bandwidth allocation method is used for each queue, then bandwidth guarantees are provided for every queue, but bandwidth utilization efficiency deteriorates when queues are idle or exceeding their allocated bandwidth
Solution Approach 1:
The patent implements dynamic bandwidth allocation by continuously monitoring queue occupancy and adjusting bandwidth assignments in real-time. When a queue's occupancy exceeds a threshold, the system dynamically increases its bandwidth allocation proportionally, transforming the static fixed allocation into a dynamic adaptive system that responds to actual traffic demands.
Solution Approach 2:
The system employs feedback mechanisms by monitoring queue occupancy levels and using this information to adjust bandwidth allocation. The scheduler receives feedback about queue states and modifies bandwidth distribution accordingly, creating a closed-loop control system that optimizes bandwidth utilization while maintaining quality of service guarantees.
2Reliability
If bandwidth is allocated to idle queues, then bandwidth guarantees are maintained, but available bandwidth for active queues is reduced
Solution Approach 1:
The system dynamically adjusts bandwidth allocation based on real-time queue occupancy. When queues become idle, their bandwidth allocation is reduced or reallocated to active queues, ensuring that bandwidth guarantees are maintained only when necessary while maximizing overall network throughput during varying traffic conditions.
Solution Approach 2:
The patent changes the bandwidth allocation parameter dynamically based on queue occupancy thresholds. When occupancy exceeds the threshold, bandwidth allocation is increased proportionally; when below threshold, allocation is reduced, allowing the system to adapt bandwidth parameters to actual network conditions and prevent bandwidth waste on idle queues.
3Device complexity
If fixed bandwidth allocation is used, then scheduling is simple, but packet drops occur when queues exceed their allocated bandwidth
Solution Approach 1:
The scheduling system automatically monitors queue occupancy and adjusts bandwidth allocation without external intervention. When queues exceed their allocated bandwidth, the system self-adjusts by reallocating bandwidth from other queues, preventing packet drops while maintaining relatively simple scheduling logic through autonomous adaptation.
Solution Approach 2:
The system modifies bandwidth allocation parameters dynamically based on monitored queue states. When a queue's occupancy exceeds its threshold, the scheduler changes its bandwidth parameter proportionally, allowing adaptive packet delivery reliability without requiring complex manual scheduling configurations.
Data Source
AI summary
A network device for scheduling packets in a plurality of queues. The network device includes a plurality of configurable mechanisms, each of which is configured to process information in one of a plurality of queues based on a predefined bandwidth. A scheduler services an associated one of the plurality of queues based on the predefined bandwidth. The network device also includes means for tracking whether or not the plurality of queues has exceeded a predefined threshold. If the plurality of queues has exceeded the predefined threshold, a new bandwidth allocation is calculated for each of the plurality of queues. The new bandwidth allocation replaces the predefined bandwidth and is proportional to the predefined bandwidth for each of the plurality of queues.