Fair Resource Allocation in Virtualized O-RAN Platforms
Not on the map. Why?
Abstract (arXiv)
O-RAN systems and their deployment in virtualized general-purpose computing platforms (O-Cloud) constitute a paradigm shift expected to bring unprecedented performance gains. However, these architectures raise new implementation challenges and threaten to worsen the already-high energy consumption of mobile networks. This paper presents first a series of experiments which assess the O-Cloud's energy costs and their dependency on the servers' hardware, capacity and data traffic properties which, typically, change over time. Next, it proposes a compute policy for assigning the base station data loads to O-Cloud servers in an energy-efficient fashion; and a radio policy that determines at near-real-time the minimum transmission block size for each user so as to avoid unnecessary energy costs. The policies balance energy savings with performance, and ensure that both of them are dispersed fairly across the servers and users, respectively. To cater for the unknown and time-varying parameters affecting the policies, we develop a novel online learning framework with fairness guarantees that apply to the entire operation horizon of the system (long-term fairness). The policies are evaluated using trace-driven simulations and are fully implemented in an O-RAN compatible system where we measure the energy costs and throughput in realistic scenarios.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 92 references that are in the map. First posted on arXiv 17 Feb 2024.
Builds on
23 of 92 references.
References · 23
- 2019Introduction to Online Convex Optimizationcited by 793
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2013Optimization, Learning, and Games with Predictable Sequencescited by 187
- 2018Deep Learning in Mobile and Wireless Networking: A Surveycited by 117
- 2014Bandits with concave rewards and convex knapsackscited by 83
- 2020Intelligence and Learning in O-RAN for Data-driven NextG Cellular Networkscited by 45
- 2018Individual Fairness in Hindsightcited by 32
- 2021Fair Exploration via Axiomatic Bargainingcited by 21
- 2022dApps: Distributed Applications for Real-time Inference and Control in O-RANcited by 17
- 2021Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curvecited by 15
- 2022MISO: Exploiting Multi-Instance GPU Capability on Multi-Tenant Systems for Machine Learningcited by 15
- 2022Enabling Long-term Fairness in Dynamic Resource Allocationcited by 15
11 more
- 2022Optimistic No-regret Algorithms for Discrete Cachingcited by 10
- 2017Online Learning for Offloading and Autoscaling in Energy Harvesting Mobile Edge Computingcited by 7
- 2020Group-Fair Online Allocation in Continuous Timecited by 6
- 2022Energy-aware Scheduling of Virtualized Base Stations in O-RAN with Online Learningcited by 6
- 2022Nonstationary Dual Averaging and Online Fair Allocationcited by 5
- 2015Computationally Aware Sum-Rate Optimal Scheduling for Centralized Radio Access Networkscited by 3
- 2018A Market-Based Framework for Multi-Resource Allocation in Fog Computingcited by 3
- 2019FALCON: An accurate real-time monitor for client-based mobile network data analyticscited by 3
- 2013Dominant Resource Fairness in Cloud Computing Systems with Heterogeneous Serverscited by 2
- 2014Multi-resource fairness: Objectives, algorithms and performancecited by 1
- 2023Fairness Guaranteed and Auction-based x-haul and Cloud Resource Allocation in Multi-tenant O-RANscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruningcited by 5
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2025Optimistic Learning for Communication Networkscited by 0
- 2026Equitable Multi-Task Learning for AI-RANscited by 0
- 2026Equitable Multi-Task Learning for AI-RANs9 Feb 2026
- 2025On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning28 May 2025
- 2025Optimistic Learning for Communication Networks4 Apr 2025
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024