Packet Queue Priority Assignment via Virtual Output Queues
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network switching devices often discard or stop traffic exceeding a prescribed rate, failing to effectively prioritize and manage different quality of service levels, leading to suboptimal network traffic flow.
Innovation Solution
Implementing a method that uses virtual output queues with metering and scheduling processes to assign priorities to packets, ensuring that peak information rates are not exceeded and committed information rates are met, through processes like round robin and strict priority scheduling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If network switches discard or stop traffic exceeding a prescribed rate, then traffic flow control is simplified, but quality of service levels cannot be properly differentiated and peak rates cannot be accommodated
Solution Approach 1:
The patent segments traffic into multiple priority queues (high priority and low priority queues) within each virtual output queue. This segmentation allows different classes of traffic to be handled differently - high priority traffic can be transmitted even when exceeding prescribed rates, while low priority traffic is policed. This resolves the contradiction by maintaining simple policing mechanisms while enabling differentiated quality of service levels through queue segmentation.
Solution Approach 2:
The patent applies different quality characteristics to different parts of the traffic flow by assigning specific priority levels to different queues. High priority queues receive preferential treatment with guaranteed transmission rights, while low priority queues subject to policing. This local differentiation of traffic handling quality enables multiple service levels without requiring complete redesign of the traffic control mechanism.
2Reliability
If network switches implement strict policing to control traffic rates, then traffic exceeding rates is discarded, but peak information rates cannot be achieved and memory is wasted
Solution Approach 1:
The patent implements dynamic priority assignment where the priority of packets is not fixed but can change based on current queue conditions and traffic flow rates. The system dynamically adjusts which packets receive high priority treatment versus low priority policing, allowing the network to adapt to varying traffic patterns and achieve peak rates when possible while maintaining rate guarantees when necessary.
Solution Approach 2:
The patent changes the parameter of packet priority from a static property to a dynamic one that can be adjusted based on traffic conditions. By changing the priority parameter of packets in different queues, the system can flexibly control traffic rates while allowing peak rates to be achieved for high priority traffic, resolving the contradiction between strict rate control and achieving peak information rates.
3Ease of operation
If all data traffic is flowed through without prioritization, then device operation is simple, but traffic exceeding prescribed rates is not properly managed
Solution Approach 1:
The patent segments the single traffic flow into multiple virtual output queues with different priority levels. This segmentation maintains operational simplicity by using standard queueing structures but adds quality of service guarantees through the priority differentiation. High priority queues receive guaranteed service while low priority queues are subject to policing, resolving the contradiction between simple operation and reliable service guarantees.
Data Source
AI summary
Setting packet queue priority is disclosed. A rate associated with a packet queue is measured. The rate is compared to a quality of service metric. A priority is assigned to the packet queue based at least in part on the comparison between the rate and the quality of service metric. The quality of service metric may be a committed information rate and/or a peak information rate.