Packet Scheduling Using Delay Thresholds and Queue Occupancy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current packet scheduling methods in communication systems, such as priority-based and fairness-based schemes, often result in increased delay for delay-sensitive traffic, leading to decreased Quality of Experience (QoE) and elevated computing overhead, particularly in environments with multiple upload flows.
Innovation Solution
A packet scheduling method and apparatus that considers delay characteristics by detecting parameter values related to delay, comparing them to threshold values, and determining packet priorities, allowing for the transmission of delay-sensitive packets before delay-insensitive ones using a multi-transmission queue architecture based on queue occupancy ratios (QORs).
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If priority-based packet scheduling is used, then throughput is improved, but delay for delay-sensitive traffic increases
Solution Approach 1:
The transmission queue is divided into multiple sub-queues based on delay characteristics (delay-sensitive and delay-insensitive). This segmentation allows different scheduling strategies to be applied to different packet types, resolving the contradiction by ensuring delay-sensitive packets receive priority handling while delay-insensitive packets maintain throughput efficiency.
Solution Approach 2:
Different scheduling policies are applied to different sub-queues based on their specific delay requirements. Delay-sensitive sub-queues use priority scheduling to minimize delay, while delay-insensitive sub-queues use fairness-based scheduling to maintain throughput. This local quality approach resolves the contradiction by optimizing each sub-queue according to its specific needs.
2Loss of time
If fairness-based packet scheduling is used, then delay for delay-sensitive traffic is reduced, but computing overhead increases
Solution Approach 1:
By segmenting packets into delay-sensitive and delay-insensitive sub-queues, the system avoids applying complex fairness-based scheduling to all packets. Instead, simple priority-based scheduling is used for delay-sensitive packets, significantly reducing computing overhead while still achieving low delay for sensitive traffic.
Solution Approach 2:
The system changes the scheduling parameter (scheduling policy) based on the delay characteristic parameter of packets. This parameter change allows the system to use computationally efficient priority scheduling for delay-sensitive packets rather than computationally intensive fairness-based scheduling, resolving the contradiction between delay reduction and overhead reduction.
3Loss of time
If queue occupancy ratio (QOR) based prioritization is used, then delay for delay-sensitive packets is reduced, but device complexity increases
Solution Approach 1:
The system uses QOR as a dynamic parameter to determine packet priority, changing the scheduling behavior based on current queue conditions. When QOR exceeds a threshold, priority scheduling is activated for delay-sensitive packets. This parameter-based approach reduces delay while keeping device complexity manageable through simple threshold comparisons rather than complex real-time optimization.
Data Source
AI summary
The present disclosure relates to a sensor network, machine type communication (MTC), machine-to-machine (M2M) communication, and technology for internet of things (IoT). The present disclosure may be applied to intelligent services based on the above technologies, such as smart home, smart building, smart city, smart car, connected car, health care, digital education, smart retail, security and safety services. A method for scheduling a packet in a communication node in a communication system is provided. The method includes detecting a parameter value of a parameter related to a delay characteristic that is related to at least one packet; comparing the detected parameter value and a preset threshold parameter value; determining a priority for the at least one packet based on the compared result; and transmitting the at least one packet corresponding to the determined priority.