Time-Varying Real-Time Online Multi-Resource Allocation for Scaling the Slices and VNF Isolation
Bibliographic record
Abstract
The infrastructure of mobile networks in 5G will offer various services in the form of network slices that can be deployed and implemented in a highly customizable manner. A real dynamic network with time-varying network utility has not been considered in previous works. In this paper, we examine the multi-resource allocation problem for network slicing in an online manner where the utility functions change over time. To solve the problems as mentioned above, we present Metis, a first systematic solution. Metis is an online network slice resource allocation framework that combines the time-varying property of the network utility function given the bandwidth and processing capacity constraints with the virtual network functions isolation requirements. As a result, we aim to maximize the cumulative network utility over time. Utilizing state-of-the-art concave optimization methods, we formulate the multi-resource allocation problem. To the best of our knowledge, this is the first work investigating an online method for multi-resources allocation for network slicing in a real-time network. Metis can proveably converge to the optimal solution, and the experiment results show a steady state behavior for Metis which converges in dynamic network settings.
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.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 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".