HSDPA Scheduler Prioritizing Real-Time Traffic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing scheduling techniques for communication networks, particularly in HSDPA/HSUPA systems, fail to adequately prioritize real-time and non-real-time data transmissions, leading to suboptimal Quality of Service (QoS) and spectral efficiency, especially in scenarios where multiple users share radio resources and retransmissions are involved.
Innovation Solution
A scheduler architecture that prioritizes real-time traffic over non-real-time traffic, allocates resources based on channel conditions and packet urgency, and dynamically adjusts power and codes allocation to minimize latency and maximize system capacity, while ensuring efficient use of shared radio resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If existing scheduling techniques are used to share radio resources among multiple users, then spectral efficiency is improved, but Quality of Service for real-time traffic deteriorates due to inadequate prioritization
Solution Approach 1:
The scheduling algorithm segments users into different priority categories (real-time users and non-real-time users) and applies different scheduling criteria to each segment. Real-time users are prioritized based on delay sensitivity metrics, while non-real-time users are scheduled using spectral efficiency metrics, resolving the contradiction by treating different user groups differently.
Solution Approach 2:
The patent applies local quality by using different performance metrics for different user types. For real-time users, the scheduling decision is based on delay sensitivity and QoS requirements, while for non-real-time users, it is based on spectral efficiency. This localized approach to metric selection ensures that each user group receives appropriate service quality.
2Loss of energy
If power and codes are equally shared between selected users, then spectral efficiency for low bit rates is optimized, but latency delay increases
Solution Approach 1:
The patent introduces dynamic scheduling where the allocation of power and codes is not fixed but adjusts based on real-time channel conditions and user priority. Real-time users receive dynamic resource allocation that prioritizes their transmission needs, reducing latency while maintaining spectral efficiency through adaptive resource management.
Solution Approach 2:
The scheduling algorithm changes key parameters (power allocation, code assignment, resource block distribution) based on user type and channel conditions. For real-time users, parameters are adjusted to minimize delay, while for non-real-time users, parameters are optimized for spectral efficiency, thus resolving the contradiction between these two objectives.
3Productivity
If multiple users are multiplexed in one Time Transmission Interval, then system capacity increases, but delay sensitivity for real-time data deteriorates
Solution Approach 1:
The patent segments the multiplexing process by creating separate scheduling queues for real-time and non-real-time users. Real-time users are scheduled first in each TTI to ensure delay sensitivity requirements are met, while non-real-time users are scheduled subsequently, allowing high system capacity through multiplexing without compromising real-time performance.
Solution Approach 2:
The scheduling algorithm performs preliminary action by prioritizing real-time user scheduling decisions before allocating resources to non-real-time users. This ensures that delay-sensitive traffic receives necessary resources first, meeting QoS requirements, while still allowing subsequent allocation to other users for high system capacity.
Data Source
AI summary
In a method of scheduling transmission services over a high speed packet access communication link such as a HSDPA and/or a HSUPA link a list of queues is created for transmission services to be provided over the link. The queues, which include both Real Time and Non Real Time queues, are allotted respective service priorities based e.g. on a channel quality indicator and/or a Quality of Service indicator to produce an ordered list of queues based on the service priorities. The link resources needed for serving at least one set of queues having higher priorities in the ordered list are estimated and a check is made. If these resources are available, the set of queues having higher priorities in the ordered list are served. If the resources required are not available, at least one queue is removed from the ordered list of queues.