Admission Control Algorithm for LTE Shared Channels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems using shared channels, such as LTE, the existing admission control algorithms often inaccurately reject bearer setup requests due to high resource utilization in low or moderate load scenarios, leading to reduced system capacity and inefficient resource allocation.
Innovation Solution
Implementing a congestion-aware admission control algorithm that disregards non-congestion resource usage and utilizes a scheduling priority or weight metric to differentiate between resource usage in congestion and non-congestion scenarios, ensuring accurate admit/reject decisions and cooperation with the scheduler.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If admission control uses total resource utilization threshold to reject bearer setup requests, then existing QoS bearers are protected from resource starvation, but unnecessary rejections occur in low or moderate load scenarios reducing system capacity
Solution Approach 1:
The patent segments the bearer population into two distinct groups: QoS bearers (with guaranteed bit rate requirements) and non-QoS bearers (best effort services). The admission control then applies different evaluation criteria to each segment - only QoS bearers are considered when evaluating resource utilization for admission decisions. This segmentation resolves the contradiction by protecting QoS bearers through targeted monitoring while avoiding unnecessary rejections caused by non-QoS bearer resource consumption.
Solution Approach 2:
The patent applies local quality by making the admission control evaluation selective rather than uniform. Instead of considering all bearers equally, the system applies a filter that gives special consideration (monitoring) only to QoS bearers while ignoring non-QoS bearers in the utilization calculation. This localized quality approach ensures that resources are protected where actually needed (for QoS contracts) while allowing flexible resource allocation elsewhere.
2Productivity
If admission control considers all bearers including best effort services, then resource allocation appears efficient, but accuracy of admit/reject decisions deteriorates due to misleading resource utilization metrics
Solution Approach 1:
The patent extracts non-QoS bearers from the admission control evaluation process. By removing best effort services from the resource utilization calculation, the system eliminates the source of misleading metrics. The admission control function now operates on a purified set of data that reflects only the resource commitments that require protection (QoS bearers), thereby restoring measurement precision without sacrificing overall resource allocation efficiency.
Solution Approach 2:
Instead of the conventional approach of including all bearers in admission control evaluation, the patent inverts the logic by explicitly excluding non-QoS bearers. This inversion reveals that the conventional inclusive approach was fundamentally flawed - it measured the wrong thing. By measuring only what matters (QoS bearer resource usage), the system achieves both accurate decision-making and efficient resource allocation.
Data Source
Figure 1~2
Figure 3
Figure 4~5
AI summary
Network node and method therein for admission control in a communication system applying shared channels for communication. The method comprises receiving a request for a bearer setup, and deciding whether to accept or reject the request for a bearer setup based on information on current bearers carrying data having a QoS value, and for which bearers a transmission of the data fulfills a criterion, the criterion representing a probability of violating the QoS value. Information on bearers carrying data which do not have a QoS value and information on bearers for which a transmission of data having a QoS value does not fulfill the criterion is disregarded.