Searcharxiv⌕ Search

arXiv · 2610.04578

Control-Compute Governance in Agentic AI-RAN: AI Agents as Both Controllers and Workloads

Abstract

Recent advances in artificial intelligence-radio access network (AI-RAN) are placing large language model (LLM)-driven agents within the open RAN (O-RAN) control hierarchy. A promising deployment for this agentic AI-RAN co-locates LLM inference with physical-layer (PHY) communication processing over the same accelerated compute pool for infrastructure sharing, data locality, and low control latency. However, this co-location induces bidirectional control-compute coupling, as the agent competes with PHY processing for compute, while its reasoned gNB control actions may alter future PHY workload and hence the compute available to its next inference. To this end, this article proposes the control-compute contract, a coordination protocol linking AI-RAN workload governance with O-RAN control execution. Specifically, we first expose direct compute contention on an over-the-air (OTA) O-RAN testbed, where continuous LLM inference increases the PHY decoding time approximately eightfold. We then formulate the contract as three protocol rules with operator-requirement protection, and map it onto O-RAN and AI-RAN functions as a five-stage workflow. Afterward, an OTA-calibrated case study of simulated uplink gNB control indicates that the contract keeps the proportion of slots violating the PHY time budget below $0.9\%$, against $20.7\%$ under ungoverned co-location, while achieving faster gNB control than a fixed compute reservation benchmark. Finally, we identify several open issues and outlooks for its practical deployment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Le Xia, Rose Qingyang Hu, Yuan Zhou, Haijian Sun. 2026-10-03. Control-Compute Governance in Agentic AI-RAN: AI Agents as Both Controllers and Workloads. https://arxiv.org/abs/2610.04578

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

KEEP EXPLORING

Related papers

From ASIC to Fleet: Lessons from Building and Operating a Hyperscaler NIC

We describe the operational infrastructure built to deploy and operate fbnic, a custom multi-host NIC, across hundreds of thousands of production hosts at Meta. Vendor multi-host NICs, designed by retrofitting single-host architectures, suffered from shared firmware and buffers that created cascading isolation failures over seven years. fbnic eliminates these through physical isolation, but shifting to in-house hardware shifts the entire operational burden to the hyperscaler. We present a hardware-in-the-loop CI pipeline testing firmware, driver, and kernel cross-products; a unified observability pipeline co-locating NIC and switch counters for cross-layer fault attribution; a driver-first architecture with fewer than ten firmware message types; a targeted firmware upgrade orchestrator at sub-sled granularity; and scoped repair automation confining blast radius to individual host slices. Over ten months, fbnic achieved a 12X reduction in unplanned unavailability, 37% lower mean time to repair, and 2.3X fewer hardware swaps compared to vendor NICs on the same platform.

cs.NI↗

Semantic Split Inference for Remote Modulation Recognition

Remote automatic modulation recognition balances sensing-node complexity, reporting cost and accuracy. To address this trade-off, we propose channel-aware semantic split inference: a sensing node sends a semantic report over a noisy link and the edge server completes recognition. In our model, split depth and report length are independent design variables, with end-to-end training through the channel. We compare the resulting design against basic split placements, which run inference at the edge server or at the sensing node, and against a state-of-the-art collaborative scheme. We assess sensing-node model size, computation, latency and energy against recognition accuracy. We show that intermediate splits give the best accuracy-cost trade-off.

cs.NI↗

When Weak Reports Matter: Staged Anchored Fusion for Cooperative UAV Sensing

Local multipath rejection can erase evidence needed for cooperative sensing. We propose staged anchored recovery: preserve strong-only confirmations, then query compatible weak reports using unused strong anchors. For any number of sensing nodes, we prove lossless residual screening and derive corroboration and bidirectional cost laws. In 1,024 five-UAV drops, recovery adds 30 matched targets and three false outputs over strict consensus, matching one-pass anchored confirmation's detection counts while reducing weak uploads by 97.4%. Equal-sized cue/report records yield 4.5% less payload than uploading all eligible reports. Independent validation recovers four additional targets with no observed false outputs.

cs.NI↗