LTE Scheduler Pre-Scheduling Resource Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication networks, particularly in LTE technology, the complexity of resource scheduling and tight processing constraints within transmission time intervals (TTIs) hinder optimal allocation of radio resources, leading to challenges in distributing finite resources across cells and potentially result in under-utilization and priority inversion.
Innovation Solution
A method and system for pre-scheduling resource units in a wireless communication network, where a module determines the total available resource units and allocates them to cells based on estimated consumption, resource limits, and prioritization, allowing for efficient allocation without recursive processing, ensuring efficient use of resources and enforcing licensing and hardware constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If iterative solutions are used to achieve global optimization of resource allocation across all cells, then optimal distribution of resources is achieved, but the complexity and processing time become too high to be processed within a TTI
Solution Approach 1:
The patent applies preliminary action by performing resource allocation decisions in advance (at the beginning of each TTI) based on estimated resource consumption, rather than using iterative optimization during the TTI. This pre-determination of resource distribution allows the system to avoid complex iterative processing while still achieving near-optimal allocation, as the estimates are refined based on actual consumption patterns over time.
Solution Approach 2:
The patent segments the resource allocation process into two distinct phases: (1) a simplified pre-scheduling phase that determines gross allocation of resources across cells based on estimates, and (2) a detailed per-UE scheduling phase that operates within each cell independently. This segmentation eliminates the need for complex iterative global optimization while maintaining efficient resource distribution.
2Productivity
If simplified pre-scheduling allocation of resources is used, then processing complexity is reduced, but resource under-utilization and priority inversion may occur
Solution Approach 1:
The patent implements feedback mechanisms where the actual resource consumption by each cell is monitored and used to refine future estimates of resource consumption. This feedback loop allows the simplified pre-scheduling approach to progressively improve its accuracy, reducing resource under-utilization and preventing priority inversion as the system adapts to actual usage patterns over time.
Solution Approach 2:
The patent applies partial action by allocating resources based on estimated consumption rather than attempting to optimize every possible scenario. The estimation approach provides sufficient accuracy for practical purposes without requiring the full complexity of iterative optimization, achieving a balance between processing speed and allocation accuracy suitable for TTI constraints.
3Manufacturing precision
If recursive processing is used to achieve optimal allocation of radio resources, then allocation optimality is improved, but the processing time exceeds the tight TTI constraints
Solution Approach 1:
The patent performs resource allocation decisions in advance at the beginning of each TTI based on estimated resource consumption, eliminating the need for recursive processing during the TTI. This preliminary determination of resource distribution allows the system to meet tight timing constraints while achieving near-optimal allocation through iterative refinement of estimates over multiple TTIs.
Data Source
AI summary
A method and system for determining, for a transmission time interval (TTI), an amount of resource units to be allocated to each cell served by at least one module in a wireless communication network are disclosed. The allocation is based on an estimated resource consumption of each cell, a resource limit of each cell and resource limits of the at least one module. For each TTI, a prioritized list of queues having information to be transmitted is determined, where each queue belongs to a cell of the plurality of cells. Also, for each TTI, in an order of priority of the queues, a number of resource units to be consumed by a queue is determined based at least in part on a number of resource units required to empty the queue.