Skip to content

Hierarchical Multi-Objective Learning for Context-Aware 5G Ran Slice Resource Allocation

Jul 2026 · 2026 ITU Kaleidoscope - AI and Frontier Technologies for Good (ITU K) · pp. 1-9 · 0 citations · 12 references

Abstract

Efficient coexistence of eMBB and URLLC services remains a critical challenge in AI-native Radio Access Networks (RANs). This paper proposes a two-timescale Hierarchical Reward Weighting (HRW) framework based on multiobjective reinforcement learning for context-aware O-RAN slicing under a Constrained Markov Decision Process (CMDP) formulation. The proposed architecture separates long-term policy adaptation from fast-timescale radio scheduling, mitigating the non-stationarity inherent in multiobjective RAN optimization. At the slow layer, a non-realtime RIC rApp exploits a long-term network context and a differentiable Softmax mapping to adapt slice reward preferences. These policies are propagated through the $O$ -RAN control hierarchy to guide downstream scheduling decisions. At the fast layer, decentralized scheduling agents embedded within the Open Distributed Unit (O-DU) MAC layer execute sub-millisecond Physical Resource Block (PRB) allocation and packet preemption, avoiding near-RT RIC transport latency constraints. Evaluated under a multiuser MIMO-OFDMA environment, the proposed framework improves resource utilization by up to 60.8% over static partitioning while maintaining bounded URLLC tail-latency behavior and strict Service Level Agreement (SLA) compliance. The results demonstrate the feasibility of AI-native hierarchical O-RAN control and align with the ITU-T visions for autonomous 6G RAN intelligence.

View source

Similar papers

Open access Jul 2026

Robust Offline Multi-Agent Reinforcement Learning for Latency-Aware SDN Path Control in 6G-Oriented Network Softwarization

Future sixth-generation (6G)-oriented networks require programmable control that can adapt routing to latency and congestion without unsafe online exploration. This study evaluates offline multi-agent deep deterministic policy gradient (MADDPG) with behavior-adjusted training rewards for latency-aware path control in software-defined networking (SDN). Each traffic pair is modeled as an agent selecting one of three retained candidate paths, while centralized critics learn coordinated decisions from topology-specific Ryu–Mininet transition datasets. Nine policies are compared using ten paired seeds on fat-tree, mesh-grid, and WAN-corridors topologies under a deployed utilization–latency weighting of 0.60/0.40, together with flow-completion, latency, congestion, architectural-comparison, sensitivity, robustness, statistical, and controller-overhead analyses. The utilization-aware path heuristic achieves the strongest overall reward ranking. MADDPG is the strongest learned policy on fat-tree, is not significantly outperformed by any evaluated policy on mesh-grid, and remains statistically tied with completion-matched policies on WAN-corridors. Behavior adjustment is topology-dependent rather than uniformly beneficial. The exported policy requires approximately 52μs per joint decision, whereas complete control-loop timing is dominated by network-statistics polling. These results support offline multi-agent SDN control as a competitive, low-overhead option when interpreted jointly with topology structure, flow completion, and strong heuristic baselines.

A. Kyzyrkanov, Y. Nurakhov, Zhenis Otarbay et al. · 0 citations
Preprint Aug 2026

LEO-Aware DRL Meta-Scheduler for 5G Non-Terrestrial Network Slicing

The integration of Low Earth Orbit (LEO) Non-Terrestrial Networks (NTNs) into 5G and upcoming 6G architectures introduces various challenges, including severe propagation delays, ultra-high base station mobility, and channel non-stationarity, complicating radio resource management of heterogeneous network slices. In this paper, we propose a deep reinforcement learning (DRL) meta-scheduler for twin-timescale resource allocation. Our solution adopts a decoupled Open Radio Access Network (RAN) architecture, in which a strategic 100 ms meta-scheduler selects scheduling policies for the different network slices using stale telemetry, while a fast-timescale MAC packet scheduler processes per-TTI user requests. The resulting Markov Decision Process captures non-stationary orbital dynamics and heterogeneous SLAs constraints via a TD3 agent. Simulation results under varying traffic load show that, unlike other solutions, the proposed meta-scheduler explicitly trades a statistically insignificant 1% capacity fraction (p>0.05) to strictly bound the variance and overall magnitude of RLC-layer queuing delay for Mission-Critical (MC) traffic. Crucially, it enforces this isolation without inducing the broadband slice starvation characteristic of standard maximum-CQI heuristics, establishing a robust foundation for 6G O-RAN NTN resource allocation.

Víctor Vilchez, T. P. C. de Andrade, Edward Hinojosa et al. · 0 citations
Review Open access 2026

Comprehensive Review of Optimization Techniques for User-Centric Distributed Network Slicing in 5G Networks

A QoE-aware framework for Multi-Access Edge Computing-enabled Open Radio Access Network (O-RAN) architectures, combining a graph attention network (GAT) encoder, distributed multi-agent DRL, and privacy-preserving FL, while transitioning control from Quality of Service (QoS) to QoE metrics is proposed.

Manoj Prasad Kunasegran, Wai Leong Pang, S. K. Phang · 0 citations
Open access 2026

Reliable Low-Latency Task Offloading and Resource Allocation Method for Space-Air-Ground Integrated Networks

: Space-Air-Ground Integrated Networks (SAGIN) provide a multi-layered, wide-coverage computing infrastructure for distributed urban sensing systems. However, their heterogeneity and dynamics pose unprecedented challenges for task offloading and resource allocation. Existing methods struggle to simultaneously address the complexity of cross-layer decision-making and reliability assurance under uncertain conditions. This paper proposes a novel framework, termed DRL-RA, which synergistically integrates Deep Reinforcement Learning (DRL) with reliability-aware optimization. The framework consists of two complementary components: (1) a Dueling Double Deep Q-Network (D3QN) module that learns adaptive policies to make offloading decisions among various options including local execution, terrestrial edge, UAVs, and satellites; (2) a Reliability-Aware Multi-Objective Optimization Framework (RA-MOOF) that introduces explicit reliability guarantees through cross-layer link reliability modeling, node availability estimation, and smooth reliability proxy functions. Addressing the heterogeneous communication characteristics of the SAGIN architecture, this paper establishes a complete cross-layer delay model and composite reliability metrics. The reliability formulation is defined under explicitly stated conditional-independence assumptions, and the proposed smooth constraint terms are treated as surrogate CMDP costs rather than exact hard chance-constraint guarantees. Extensive experiments in a SAGIN simulation environment demonstrate that the proposed method improves the task completion rate by 3.8%, reduces average latency by 11.1%, and increases system reliability by 3.9% compared to state-of-the-art benchmarks. The optimization-only RA-Opt baseline is used as a non-real-time optimization reference for assessing reliability-aware offloading decision quality, while deployment-time decision-latency comparisons are interpreted primarily among learned inference policies. Comprehensive ablation studies and statistical validation across multiple random seeds confirm the contributions of each component, while cross-layer offloading decision analysis verifies the effectiveness of the method across different network layer selections.

Fei-Yan Bu, Zheng Wang, Yong Pan et al. · 0 citations
Preprint Aug 2026

Agentic Quantum Deep Reinforcement Learning for RAN Slicing

Radio access network (RAN) slicing enables ultra-reliable low-latency communications (URLLC) and enhanced mobile broadband (eMBB) services to share radio resources, but their requirements create a challenging reliability--throughput tradeoff. URLLC requires low-latency and reliable packet delivery, whereas eMBB targets high sustained throughput. This paper considers downlink URLLC/eMBB RAN slicing and formulates it as a queue-aware long-term eMBB throughput maximization problem subject to URLLC delay-violation, physical resource block (PRB) exclusivity, and slice-budget constraints. To solve this problem, we propose agentic quantum deep reinforcement learning (Agentic-QDRL), a two-time-scale framework that combines agentic slice-level resource control with quantum-enhanced PRB scheduling. At the slow time scale, a perceive--memory--act--reflect (PMAR) controller adapts the resource shares of URLLC and eMBB slices. At the fast time scale, a compact variational quantum circuit (VQC)-based QDRL scheduler performs PRB allocation under the current slice configuration. A feasibility projection and a safety fallback mechanism is further introduced to satisfy scheduling constraints and reduce URLLC deadline violations. Simulation results under different eMBB traffic loads show that Agentic-QDRL improves eMBB throughput, reduces eMBB queue buildup, and maintains URLLC delay reliability compared with classical DRL and heuristic baselines.

Tingnan Bao, Medhat H. M. Elsayed, Pedro Enrique Iturria-Rivera et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.