Logical Channel Scheduling Groups for Low-Latency Traffic Prioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing logical channel (LCH) prioritization techniques struggle to effectively manage diverse traffic types with hard delay requirements and low latency needs, failing to optimize throughput and latency performance in wireless communication systems.
Innovation Solution
Implementing scheduling policies between and within scheduling groups composed of LCHs, using different scheduling algorithms like Earliest Deadline First (EDF) and Fair Priority Queuing (FPQ) to prioritize traffic based on group and individual LCH criteria, ensuring efficient handling of delay-sensitive and low-latency applications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing LCH prioritization techniques are used, then system simplicity is maintained, but delay-sensitive traffic handling and latency performance deteriorate
Solution Approach 1:
The patent segments LCHs into multiple scheduling groups (e.g., first scheduling group for delay-sensitive traffic, second scheduling group for other traffic). Each group can be configured with different scheduling policies, allowing differentiated handling of traffic types. This segmentation enables the system to prioritize delay-sensitive traffic without applying complex scheduling to all LCHs uniformly.
Solution Approach 2:
The patent introduces dynamic scheduling policies including Earliest Deadline First (EDF) and Fair Priority Queuing (FPQ) that can be applied to scheduling groups. These dynamic policies allow the system to adaptively adjust scheduling behavior based on traffic characteristics and QoS requirements, improving latency performance for delay-sensitive applications while maintaining flexibility.
2Loss of time
If scheduling groups with different policies are implemented, then latency performance is improved, but device complexity increases
Solution Approach 1:
By segmenting LCHs into scheduling groups, the patent reduces the complexity of managing individual LCH priorities. Instead of configuring each LCH separately with complex priority rules, the system groups LCHs and applies scheduling policies at the group level, simplifying the overall configuration while still achieving differentiated latency performance.
Solution Approach 2:
The patent creates a universal scheduling framework that can handle multiple traffic types and QoS requirements through a common grouping mechanism. The same scheduling group structure and policy application method can be used for different traffic scenarios, reducing the need for separate complex configurations for each traffic type.
Data Source
AI summary
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may receive a scheduling configuration associated with a plurality of logical channel (LCH) scheduling groups. The UE may transmit data from at least one LCH in an LCH scheduling group, of the plurality of LCH scheduling groups, according to a priority policy that the scheduling configuration indicates for the at least one LCH scheduling group. Numerous other aspects are described.