Machine Learning Based Resource Orchestration for 5G Network Slices
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
5G will serve heterogeneous demands in terms of data-rate, reliability, latency, and efficiency. Mobile operators shall be able to serve all of these requirements using shared network infrastructure's resources. To this end, we propose in this paper a framework for resource orchestration for 5G network slices implementing four Quality of Service pillars. Starting from traffic classification, demands are marked so that they are best served by dedicated logical virtual networks called Network Slices (NSs). To optimally serve multiple NSs over the same physical network, we then implement a new dynamic slicing approach of network resources exploiting Machine Learning (ML). Indeed, as demands change dynamically, a mere recursive optimization leading to progressive convergence towards an optimum slice is not sufficient. Consequently, we need an initial well-informed slicing decision of physical resources from a total available resource pool. Moreover, we formalize both admission control and slice scheduler modules as Knapsack problems. Using our 5G experimental prototype based on OpenAirInterface (OAI), we generate a realistic dataset for evaluating ML based approaches as well as two baselines solutions (i.e. static slicing and uninformed random slicing-decisions). Simulation results show that using regression trees as an ML based approach for both classification and prediction, outperform other alternative solutions in terms of prediction accuracy and throughput.
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