MétaCan
Menu
Back to cohort

ML-Based Strategies to Optimize O-RAN VNFs for Latency and Reliability

2023· article· en· W4396879169 on OpenAlexaff
Ibrahim Tamim, Abdallah Shami, Lyndon Ong

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsWestern University
Fundersnot available
KeywordsRanComputer scienceSoftware deploymentC-RANVirtualizationCloud computingRadio access networkLatency (audio)Computer networkThe InternetReinforcement learningCrashReliability (semiconductor)Distributed computingOperating systemBase stationTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

The Open Radio Access Network (O-RAN) combines the benefits of virtualization and Machine Learning (ML) to enhance Radio Access Networks (RANs), providing advanced automation, self-organization, and closed-loop optimization across the RAN architecture. This approach efficiently manages the sharply rising network traffic in RANs and introduces open interfaces that enable the virtual hosting of its components on the O-Cloud, as well as hosting ML training and inference modules. This transition to a virtualized environment and an ML-supportive architecture paves the way for applying advanced ML-assisted solutions to dynamically optimize, oversee, and monitor the O-RAN. In this study, we begin by offering a straightforward overview of how to implement an ML pipeline in O-RAN. Next, we explore latency and reliability challenges in two O-RAN deployment use cases, suggesting ML-assisted solutions for each. Lastly, we detail our implementation of a deep reinforcement learning solution to boost O-RAN's availability by optimizing the placement of its units. Our proposed solution showcases the effectiveness of ML-assisted solutions by maximizing the availability of a large-scale Critical Internet of Things O-RAN deployment in a reasonable time frame.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.672
Threshold uncertainty score0.348

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.269
Teacher spread0.248 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicSoftware-Defined Networks and 5GFrench-language works237,207