QoS‐aware call admission control in wideband CDMA wireless networks
Bibliographic record
Abstract
Abstract Efficient call admission control (CAC) technique plays a major role in ensuring the quality of service (QoS) requirements of different traffic classes and achieving flexible radio resource utilization in wideband CDMA system like universal mobile telecommunication system (UMTS). In this paper, we propose a novel QoS‐aware CAC framework for radio access in wideband wireless UMTS networks. It features an efficient CAC algorithm coupled with a QoS class‐separation mechanism based on the transmitted power of each individual mobile terminal. Three inter‐relating components have been introduced to extend a currently existing UMTS uplink admission control scheme. First, we introduce a measurement‐based component to calculate the current load of the system; second, this measurement‐based component is integrated with a power prediction module to estimate the load increment that the new call will bring into the system; and third, the proposed framework feeds the results obtained to a CAC algorithm with a QoS‐enforcing mechanism that gives each class of traffic different treatment based on the QoS requirement of the connections. To the best of our knowledge, ours is a first attempt towards combining the above components into one uplink CAC framework that aims to enhance system performance and to achieve per‐class QoS objectives. Simulation results show the major impact on the performance of UMTS which is reflected in increased throughput and lower blocking and dropping. Copyright © 2006 John Wiley & Sons, Ltd.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.006 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".