A Trustworthy Deep Reinforcement Learning Framework for Slicing in Next-Generation Open Radio Access Networks
Bibliographic record
Abstract
Open radio access networks (O-RANs) represent a transformative architecture in mobile communications, enabling multiple services to coexist on the same infrastructure through network slicing. This allows mobile network operators (MNOs) to partition the network into distinct virtual slices, each tailored to meet the specific needs of one of the supported services. Such services reflect diverse, sometimes contradictory, requirements from data-intensive services such as ultra-high definition (UHD) video streaming to latency-intolerant services such as extended reality (XR) applications. Intelligent resource management algorithms are essential to ensuring these services simultaneously meet their performance requirements. While deep reinforcement learning (DRL) has shown promise in managing inter-slice resource allocation (RA), its practical application faces several challenges, such as generalization and safety, which hinder the widespread adoption of DRL algorithms in real environments. This thesis makes several key contributions to address these challenges. First, we introduce a trustworthy reinforcement learning (RL) framework for O-RAN that systematically deals with such practical challenges in online deployment settings. Next, we propose a hybrid transfer learning (TL)-aided DRL approach, combining policy reuse and distillation methods, to enhance the generalization of DRL-based slicing policies to new network scenarios. We also develop a safe DRL-based slicing approach to reduce violations of the slices' latency requirements. This includes designing a reward function that reflects such requirements and learning a cost model that estimates the latency attached to an action. Finally, we design predictive mechanisms incorporating pre-trained policy selection and demand forecasting models to improve RL-based slicing agents' performance under extreme network situations. Together, these contributions advance the practical deployment of DRL-based resource management agents in O-RAN. Extensive simulations using real network traces demonstrate that our proposed trustworthy RL approaches significantly improve service level agreement (SLA) satisfaction and reduce latency while maintaining reasonable resource consumption across O-RAN slices. These results highlight the applicability of our methods to address the diverse service requirements in dynamic O-RAN deployment environments, particularly in immersive applications. While we focus on optimizing inter-slice RA within O-RAN, our framework offers a pathway toward more comprehensive, predictive resource management strategies, ensuring robust performance in uncertain network environments regardless of the architecture.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".