Dynamic Resource Allocation With RAN Slicing and Scheduling for uRLLC and eMBB Hybrid Services
Bibliographic record
Abstract
To cope with the limited radio and power resources, designing energy- and cost-efficient resource allocation strategy with RAN slicing and scheduling is important in ensuring the extreme QoS of differentiated Internet of things (IoT) services. In this regard, we focus on guaranteeing the latency and reliability of sporadic uRLLC uplink traffic while improving the quality of continuous eMBB services (e.g., quality of the video) together in this paper. Firstly, a dynamic optimization model considering power consumption and service quality is used to construct the cost function in both time domain and frequency bandwidth for heterogeneous services, subject to the latency constraint. Secondly, given its complexity, a novel two-timescale algorithm with employing Lyapunov optimization is designed, including two sub-algorithms: long-timescale bandwidth allocation and short-timescale service control. In further, the theoretical optimality is analyzed according to the relationships between control parameters and service performances. The utility of our approach and its hard latency guarantee are also illustrated through simulation results under tolerable power consumption.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 |
| 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".