Multi-Objective Multi-Dimensional Resource Allocation for Categorized QoS Provisioning in Beyond 5G and 6G Radio Access Networks
Bibliographic record
Abstract
To effectively meet the diverse Quality of Service (QoS) requirements from proliferating applications, a widely-adopted practical solution in radio access network (RAN) is categorized QoS provisioning, which utilizes virtual networks (i.e., tenants) to support a limited number of service categories. Apparently, one critical issue is RAN resource allocation among coexisting tenants. However, conventional single objective-based approaches cannot ensure fairness among different service categories. Moreover, except for radio resource, computing and storage resources also need to be considered. Besides, appropriate allocation of computing and storage resources could help mitigating backhaul network congestion. Hence, we aim to optimize the key QoS indicators of three main service categories and reduce backhaul bandwidth consumption simultaneously. We formulate the problem of multi-dimensional resource allocation from RAN to tenants as a multi-objective mixed-integer non-linear programming (MINLP) problem, which is challenging to solve directly due to the competing objectives and the mutual-influenced resources. For guaranteeing fairness, this problem is reformulated as a single-objective optimization problem using weighted sum approach. Moreover, a decoupling-based iterative optimization (DBIO) algorithm is proposed to decompose it into three subproblems to solve iteratively. Simulation results demonstrate that DBIO algorithm can achieve superior performance with much less time consumption, compared with three metaheuristic algorithms.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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".