Search arXivSearch

arXiv · 2607.01583

Enabling Real-Time AI in O-RAN: Deploying and Measuring AI Inside a Near-RT RIC xApp

Abstract

Open Radio Access Network (O-RAN) architectures introduce programmable Near-Real-Time RAN Intelligent Controllers (Near-RT RICs) that support closed-loop control through xApps at timescales from 10 ms to 1 s. Although AI has been widely studied for RAN optimization, fewer works demonstrate measured AI inference embedded directly within the Near-RT RIC software loop on a live testbed. This paper presents an AI-enabled network-state classification xApp implemented on an OpenAirInterface (OAI) and FlexRIC testbed. The xApp is trained and evaluated on a structured synthetic dataset that emulates cross-layer RAN states using MAC, RLC, PDCP, GTP, and UE-count features. The results validate embedding and execution feasibility rather than production-level generalization. Logistic regression and a shallow multilayer perceptron (MLP) are exported as deterministic C inference modules and compiled into the xApp binary, eliminating external machine-learning runtime dependencies. Measured inference latency is 1 to 5 microseconds for logistic regression and 10 to 25 microseconds for the MLP, while end-to-end service latency remains below 4 ms. A six-model comparison shows that supervised models achieve similar accuracy, ranging from 0.88 to 0.90, indicating that LR and MLP similarity reflects the proxy problem structure rather than limited model exploration. Noise ablation, confusion-matrix analysis, and CDF-based latency characterization show that both embedded models satisfy the 10 ms Near-RT budget for more than 95% of projected loop executions. These results demonstrate that lightweight AI can operate within Near-RT RIC timing constraints while preserving deterministic execution. We also release RIC Workbench, a lightweight orchestration dashboard for reproducing the testbed on commodity hardware.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lawrence Obiuwevwi, Krzysztof J. Rechowicz, Sampath Jayarathna, Safdar Hussain Bouk, Fahmida Afrin, C. Nicolas Barati, Neda Moghim, Valentina Nanou, Muhammad Enayetur Rahman, Sachin Shetty. 2026-07-07. Enabling Real-Time AI in O-RAN: Deploying and Measuring AI Inside a Near-RT RIC xApp. https://arxiv.org/abs/2607.01583

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI