Results show that online twin-fidelity monitoring enables robust digital-twin-assisted xApp conflict resolution while preserving utility-aware throughput-power optimization, and achieves the closest throughput-power trade-off to the optimum across operator energy priorities.
Abstract
Open Radio Access Network (O-RAN) allows independently developed xApps to control RAN functions through the Near-Real-Time RAN Intelligent Controller (Near-RT RIC). When xApps with conflicting objectives operate concurrently, they may issue incompatible actions that degrade network performance. This paper addresses a direct conflict in which an energy-saving (ES) xApp and a coverage/throughput-oriented (CTO) xApp request different downlink transmit-power settings for the same cell. We formulate conflict resolution as online selection of a continuous blend of the two proposals, maximizing an energy-aware utility that jointly considers throughput and power consumption. A network digital twin (NDT) predicts this utility for candidate actions before live deployment, but selecting the highest twin-predicted utility becomes ineffective when the twin drifts. We therefore propose a twin-fidelity-aware hard-switching arbiter that monitors the error between predicted and observed utilities using an exponentially weighted moving average. While the error remains below a threshold, the arbiter follows the NDT-selected action; otherwise, it switches to the best previously observed action learned online. The arbiter is lightweight, training-free, and requires no oracle knowledge of the optimal policy. System-level 5G evaluations show that it achieves the closest throughput-power trade-off to the optimum across operator energy priorities, yielding normalized utility regret of $0.017 \pm 0.006$, versus $0.159 \pm 0.052$ for a COMIX-style twin-based selector. Under severe NDT drift (10 dB), it reduces utility regret from $11.19 \pm 3.58$ to $0.55 \pm 0.25$. These results show that online twin-fidelity monitoring enables robust digital-twin-assisted xApp conflict resolution while preserving utility-aware throughput-power optimization.
This paper proposes CORMO-RAN, a data-driven orchestrator that dynamically activates compute nodes based on xApp load to save energy, and performs lossless migration of xApps from nodes to be turned off to active ones while ensuring xApp availability during migration.
Antonio Calagna, Stefano Maxenti, Leonardo Bonati et al.· IEEE Transactions on Mobile...· 2 citations
A degeneracy-aware resource allocation framework that casts multi-architecture orchestration as a probabilistic game and, unlike single-solution optimization, deliberately favors allocations realizable by many structurally distinct yet performance-equivalent strategy profiles is proposed.
A Proportional Fairness (PF)-driven framework for allocating Co-SR transmit power on a per-Transmission Opportunity (TXOP) basis is introduced, and it is proved that any Pareto-optimal power pair keeps at least one AP at its maximum power.
This paper formulates uplink MPQUIC scheduling as a multi-objective optimization problem that jointly considers maximum upload completion time and total LTE usage and proposes a Bayesian Optimization-based framework that treats the MPQUIC system as a black box and systematically explores probabilistic path selection co...
T. Nguyen, T. Lê, Phi Le Nguyen et al.· arXiv.org· 0 citations
This paper investigates the energy-aware joint placement and migration of cloud-native functions (CNFs) in an O-RAN edge cloud with a Mixed-Integer Linear Program that minimizes server, transmission, wake-up, and migration energy while satisfying server-resource capacities and one-way delay requirements over the F1 use...
Nguyen Phuc Tran, B. Jaumard, Oscar Delgado· 0 citations
The ER-RL-DVFS framework combines an energy-risk task-priority score, DVFS-aware cluster–PM–VM profiling, hierarchical candidate filtering, deterministic score-based assignment for clearly separated candidates, selective tabular reinforcement learning as the prescribed refinement mechanism for near-tie decisions, and m...
Amir Javadpour, Forough Ja'fari, T. Taleb· Computing· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.