MétaCan
Menu
Back to cohort

Energy Efficient Orchestration for O-RAN

2024· article· en· W4408324761 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsEricsson (Canada)
Fundersnot available
KeywordsOrchestrationRanComputer scienceC-RANEnergy (signal processing)TelecommunicationsComputer networkRadio access networkPhysicsArt

Abstract

fetched live from OpenAlex

Open Radio Access Network (O-RAN) aims to establish an open and intelligent RAN architecture, enhancing flexibility, scalability, and network optimization. Machine learning (ML) technologies are pivotal in realizing these objectives by facilitating intelligent decision-making, automated optimization, and proactive maintenance. However, effectively selecting and deploying ML models within O-RAN to achieve energy efficiency poses significant challenges. In this paper, we propose a novel orchestration scheme tailored for next-generation systems, building upon and extending the foundational principles of the O-RAN paradigm. Our proposed orchestration policy offers a practical solution for deploying ML applications within the ORAN framework. Through comprehensive evaluation, our scheme demonstrates a remarkable reduction of up to 72.22% in energy consumption compared to the maximum performance baseline, while maintaining an accuracy level of approximately 94.56% relative to the same baseline.

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.

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: Empirical · Consensus signal: none
Teacher disagreement score0.913
Threshold uncertainty score0.130

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.017
GPT teacher head0.245
Teacher spread0.228 · 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

Quick stats

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207