Energy-aware Scheduling of Virtualized Base Stations in O-RAN with
Online Learning
- URL: http://arxiv.org/abs/2208.09956v2
- Date: Tue, 23 Aug 2022 16:20:04 GMT
- Title: Energy-aware Scheduling of Virtualized Base Stations in O-RAN with
Online Learning
- Authors: Michail Kalntis, George Iosifidis
- Abstract summary: We propose an online learning algorithm for balancing the performance and energy consumption of a vBS.
Our findings indicate savings of up to 74.3% in the power consumption of a vBS in comparison with state-of-the-art benchmarks.
- Score: 18.757368441841127
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The design of Open Radio Access Network (O-RAN) compliant systems for
configuring the virtualized Base Stations (vBSs) is of paramount importance for
network operators. This task is challenging since optimizing the vBS scheduling
procedure requires knowledge of parameters, which are erratic and demanding to
obtain in advance. In this paper, we propose an online learning algorithm for
balancing the performance and energy consumption of a vBS. This algorithm
provides performance guarantees under unforeseeable conditions, such as
non-stationary traffic and network state, and is oblivious to the vBS operation
profile. We study the problem in its most general form and we prove that the
proposed technique achieves sub-linear regret (i.e., zero average optimality
gap) even in a fast-changing environment. By using real-world data and various
trace-driven evaluations, our findings indicate savings of up to 74.3% in the
power consumption of a vBS in comparison with state-of-the-art benchmarks.
Related papers
- Energy-Efficient Federated Edge Learning with Streaming Data: A Lyapunov Optimization Approach [34.00679567444125]
We develop a dynamic scheduling and resource allocation algorithm to address the inherent randomness in data arrivals and resource availability under long-term energy constraints.
Our proposed algorithm makes adaptive decisions on device scheduling, computational capacity adjustment, and allocation of bandwidth and transmit power in every round.
The effectiveness of our scheme is verified through simulation results, demonstrating improved learning performance and energy efficiency as compared to baseline schemes.
arXiv Detail & Related papers (2024-05-20T14:13:22Z) - Adaptive Resource Allocation for Virtualized Base Stations in O-RAN with
Online Learning [60.17407932691429]
Open Radio Access Network systems, with their base stations (vBSs), offer operators the benefits of increased flexibility, reduced costs, vendor diversity, and interoperability.
We propose an online learning algorithm that balances the effective throughput and vBS energy consumption, even under unforeseeable and "challenging'' environments.
We prove the proposed solutions achieve sub-linear regret, providing zero average optimality gap even in challenging environments.
arXiv Detail & Related papers (2023-09-04T17:30:21Z) - IoV Scenario: Implementation of a Bandwidth Aware Algorithm in Wireless
Network Communication Mode [49.734868032441625]
This paper proposes a bandwidth aware multi domain virtual network embedding algorithm (BA-VNE)
The algorithm is mainly aimed at the problem that users need a lot of bandwidth in wireless communication mode.
In order to improve the performance of the algorithm, we introduce particle swarm optimization (PSO) algorithm.
arXiv Detail & Related papers (2022-02-03T03:34:06Z) - Adaptive Transmission Scheduling in Wireless Networks for Asynchronous
Federated Learning [13.490583662839725]
We study asynchronous federated learning (FL) in a wireless learning network (WDLN)
We formulate an Asynchronous Learning-aware transmission Scheduling (ALS) problem to maximize the effectivity score.
We show via simulations that the models trained by our ALS algorithms achieve performances close to that by an ideal benchmark.
arXiv Detail & Related papers (2021-03-02T02:28:20Z) - Reinforcement Learning for Datacenter Congestion Control [50.225885814524304]
Successful congestion control algorithms can dramatically improve latency and overall network throughput.
Until today, no such learning-based algorithms have shown practical potential in this domain.
We devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks.
We show that this scheme outperforms alternative popular RL approaches, and generalizes to scenarios that were not seen during training.
arXiv Detail & Related papers (2021-02-18T13:49:28Z) - Towards AIOps in Edge Computing Environments [60.27785717687999]
This paper describes the system design of an AIOps platform which is applicable in heterogeneous, distributed environments.
It is feasible to collect metrics with a high frequency and simultaneously run specific anomaly detection algorithms directly on edge devices.
arXiv Detail & Related papers (2021-02-12T09:33:00Z) - Distributed Multi-agent Meta Learning for Trajectory Design in Wireless
Drone Networks [151.27147513363502]
This paper studies the problem of the trajectory design for a group of energyconstrained drones operating in dynamic wireless network environments.
A value based reinforcement learning (VDRL) solution and a metatraining mechanism is proposed.
arXiv Detail & Related papers (2020-12-06T01:30:12Z) - Depth-Optimized Delay-Aware Tree (DO-DAT) for Virtual Network Function
Placement [3.5584529568201377]
Network Function (NFV) has been identified as a solution, but several challenges must be addressed to ensure its feasibility.
We present a machine learning-based solution to the Virtual Network (VNF) placement problem.
arXiv Detail & Related papers (2020-06-02T17:18:20Z) - Meta-Reinforcement Learning for Trajectory Design in Wireless UAV
Networks [151.65541208130995]
A drone base station (DBS) is dispatched to provide uplink connectivity to ground users whose demand is dynamic and unpredictable.
In this case, the DBS's trajectory must be adaptively adjusted to satisfy the dynamic user access requests.
A meta-learning algorithm is proposed in order to adapt the DBS's trajectory when it encounters novel environments.
arXiv Detail & Related papers (2020-05-25T20:43:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.