Enhanced Control for Adaptive Resource Reservation of Guaranteed Services in LTE Networks
Bibliographic record
Abstract
Mobile innovative services are being introduced continuously to enhance people's life through facilitating the interaction between human and the rest of the world. The world of “Internet of Things” (IoT) is expanding everyday to include more things to be connected. Considering that more and more innovative mobile services are being introduced, the long-term evolution (LTE) telecom systems/networks will be more complicated, require more resources, and demand more challenging requirements. The LTE evolved packet core (EPC) network internal design is inadequate with regard to the resources reservation techniques used to carry out the guaranteed dedicated services. In fact, EPC does not have the capabilities to utilize properly the unused bandwidth of the guaranteed bearer when the reserved bandwidth is not fully used by the mobile service, the unused guaranteed bandwidth is considered as wasted resources and consequently the whole LTE/EPC network efficiency gets affected. In this paper, we propose an adaptive technique which enhances the resource reservation for the LTE Mobile guaranteed services, our solution provides techniques to: analyze the ongoing mobile guaranteed traffic usage, provide time-series models that mathematically represent the conducted data, forecast the mobile service guaranteed resource consumption, identify the wasted/unused resources, and utilize these resources by other services. Our experiments were conducted on a dataset captured on an LTE network, the experimental results show that our approach is feasible and beneficial as it enhances the resource allocation for the LTE mobile services and increases the overall throughput of the LTE/EPC networks.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| 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.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".