New Courteous Algorithm for Uplink Scheduling in LTE-Advanced and 5G Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The fast evolution of the number of wireless users and the emergence of new multimedia services have motivated third-generation partnership project (3GPP) to develop new radio access technologies. Thus, the carrier aggregation (CA) was introduced from version 10 long-term evolution (LTE), known as long-term evolution-advanced (LTE-A), to meet the increasing demands in terms of throughput and bandwidth and to ensure the Quality of Service (QoS) for different classes of bearers in LTE networks. However, such solution stills inefficient until implementing good resources management scheme. Several scheduling mechanisms have been proposed in the literature, to guarantee the QoS of different classes of bearers in LTE-A and 5G networks. Nevertheless, most of them promote high-priority bearers. In this study, a new approach of uplink scheduling resources has been developed. It aims to ensure service fairness of different traffic classes that allocates bearers over LTE-A and 5G networks. Also, it raises the number of admitted users in the network by increasing the number of admitted bearers through a dynamic management of service priorities. In fact, the low-priority traffic classes, using low-priority bearers, are favoured during a specific time interval, based on the average waiting time for each class. Simulation results show that the QoS parameters were much improved for the low-priority classes without significantly affecting the QoS of high priority ones.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it