Deep Reinforcement Learning for Robust VNF Reconfigurations in O-RAN

18Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Open Radio Access Networks (O-RANs) have revolutionized the telecom ecosystem by bringing intelligence into disaggregated RAN and implementing functionalities as Virtual Network Functions (VNF) through open interfaces. However, dynamic traffic conditions in real-life O-RAN environments may require necessary VNF reconfigurations during run-time, which introduce additional overhead costs and traffic instability. To address this challenge, we propose a multi-objective optimization problem that minimizes VNF computational costs and overhead of periodical reconfigurations simultaneously. Our solution uses constrained combinatorial optimization with deep reinforcement learning, where an agent minimizes a penalized cost function calculated by the proposed optimization problem. The evaluation of our proposed solution demonstrates significant enhancements, achieving up to 76% reduction in VNF reconfiguration overhead, with only a slight increase of up to 23% in computational costs. In addition, when compared to the most robust O-RAN system that doesn't require VNF reconfigurations, which is Centralized RAN (C-RAN), our solution offers up to 76% savings in bandwidth while showing up to 27% overprovisioning of CPU.

Cite

CITATION STYLE

APA

Amiri, E., Wang, N., Shojafar, M., Hamdan, M. Q., Foh, C. H., & Tafazolli, R. (2024). Deep Reinforcement Learning for Robust VNF Reconfigurations in O-RAN. IEEE Transactions on Network and Service Management, 21(1), 1115–1128. https://doi.org/10.1109/TNSM.2023.3316074

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free