Reinforcement Learning Based Dynamic Function Splitting in Disaggregated Green Open RANs
Bibliographic record
Abstract
With the growing momentum around Open RAN (O-RAN) initiatives, performing dynamic Function Splitting (FS) in disaggregated and virtualized Radio Access Networks (vRANs), in an efficient way, is becoming highly important. An equally important efficiency demand is emerging from the energy consumption dimension of the RAN hardware and software. Supplying the RAN with Renewable Energy Sources (RESs) promises to boost the energy-efficiency. Yet, FS in such a dynamic setting, calls for intelligent mechanisms that can adapt to the varying conditions of the RES supply and the traffic load on the mobile network. In this paper, we propose a reinforcement learning (RL)based dynamic function splitting (RLDFS) technique that decides on the function splits in an O-RAN to make the best use of RES supply and minimize operator costs. We also formulate an operational expenditure minimization problem. We evaluate the performance of the proposed approach on a real data set of solar irradiation and traffic rate variations. Our results show that the proposed RLDFS method makes effective use of RES and reduces the cost of an MNO. We also investigate the impact of the size of solar panels and batteries which may guide MNOs to decide on proper RES and battery sizing for their networks.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".