Priority Scheduling and Admission Control in Communication Networks
Solution Overview
Problem
Communication networks face challenges in prioritizing data transmission and admission control, especially during high loading conditions such as natural disasters, where emergency personnel's communication needs to be prioritized over the general public.
Innovation Solution
Implementing priority scheduling and admission control techniques that allow for data flow prioritization, where packets are placed in queues based on priority levels, and admission control is managed based on cell loading to ensure priority data flows are maintained during heavy loads.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If all data flows are admitted during light loading conditions, then network resource utilization is maximized, but queuing delays increase when loading becomes heavy
Solution Approach 1:
The patent segments data flows into priority and non-priority categories, allowing differentiated handling. During heavy loading, only priority data flows are admitted while non-priority flows are blocked, ensuring that critical traffic experiences minimal queuing delay while maximizing overall network utilization during light loading conditions.
Solution Approach 2:
The system dynamically changes admission control parameters based on network loading conditions. When loading transitions from light to heavy, the admission threshold is adjusted to block non-priority flows, thereby reducing queuing delays for priority traffic while maintaining high resource utilization during normal operations.
2Reliability
If priority scheduling is implemented to reduce queuing delays for emergency personnel, then service quality for priority users is improved, but network complexity increases
Solution Approach 1:
The patent extracts priority data flows from the general data flow stream and places them in a separate priority queue. This extraction mechanism allows priority traffic to be handled independently with guaranteed service quality, while the scheduling complexity is confined to the queue management logic rather than affecting the entire network infrastructure.
Solution Approach 2:
The system performs preliminary classification of data flows into priority and non-priority categories before admission control decisions are made. This pre-categorization simplifies the scheduling mechanism by establishing clear admission rules based on flow type, reducing the complexity of real-time scheduling decisions during heavy loading conditions.
3Loss of time
If admission control is strictly enforced during heavy loading to protect priority flows, then queuing delays for priority traffic are reduced, but overall network throughput decreases
Solution Approach 1:
The admission control mechanism dynamically adjusts its strictness based on network loading conditions. During light loading, all data flows are admitted to maximize throughput. When loading becomes heavy and priority queue delay thresholds are exceeded, the system dynamically blocks non-priority flows to protect priority service quality, thereby balancing throughput and delay performance across different operating conditions.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
A method of sending data in a communication network and a corresponding apparatus is described, wherein multiple queues for multiple traffic classes (TC1..5), one queue for each traffic class (TC1..5) are maintained and wherein multiple priority levels for each of the multiple traffic classes (TC1..5) are supported, the multiple priority levels for each traffic class (TC1..5) being associated with different points in the queue for the traffic class (TC1..5), the method comprising placing each of a plurality of packets in a queue for a traffic class (TC1..5) of the packet and at a point in the queue determined by a priority level of the packet and sending the packets in the queues in a sequential order.