Metraipolis › archive › dc_8e34d03ec643
Next-generation O-RAN Edge: Energy-aware Joint Placement and Migration of Cloud-Native Functions — arXiv:2608.24841
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24841
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T06:22:11.228Z
- SHA-256 of the archived text
53c1bb980bd1206149009fca01bef3394d46d789ce58a62024103bae88f52a2f- Stable URL of this page
https://metraipolis.com/documento/dc_8e34d03ec643
How to cite
Next-generation O-RAN Edge: Energy-aware Joint Placement and Migration of Cloud-Native Functions — arXiv:2608.24841 — arXiv (en), https://arxiv.org/abs/2608.24841 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8e34d03ec643 (Metraipolis archive dc_8e34d03ec643, sha256 53c1bb980bd1206149009fca01bef3394d46d789ce58a62024103bae88f52a2f)
BibTeX
@misc{dc8e34d03ec643,
title = {Next-generation O-RAN Edge: Energy-aware Joint Placement and Migration of Cloud-Native Functions — arXiv:2608.24841},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24841},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8e34d03ec643; sha256 53c1bb980bd1206149009fca01bef3394d46d789ce58a62024103bae88f52a2f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24841. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The transition toward Open Radio Access Networks (O-RANs) is reshaping how cellular infrastructure is deployed, managed, and optimized. This paper investigates the energy-aware joint placement and migration of cloud-native functions (CNFs) in an O-RAN edge cloud. We consider both a Single-CU-UP association model and a slice-aware Multi-CU-UP relaxation, in which distinct slice-flow groups of the same distributed unit (DU) may be assigned to different Centralized Unit User Plane (CU-UP) processing targets under one Centralized Unit Control Plane (CU-CP). For brevity, these scenarios are referred to as Single-CU and Multi-CU, respectively; Multi-CU never denotes multiple CU-CP associations. We formulate the problem as a Mixed-Integer Linear Program (MILP) that minimizes server, transmission, wake-up, and migration energy while satisfying server-resource capacities and one-way delay requirements over the F1 user-plane interface (F1-U) between each DU and its selected CU-UP in a fat-tree edge data center. To improve computational scalability, we also develop a deterministic k-means-based heuristic that approximates the MILP decisions without requiring repeated exact optimization. Over the evaluated 24-hour workload, the theoretical Multi-CU relaxation reduces modeled energy consumption by 5.7% relative to the Single-CU baseline. For the Multi-CU case, the proposed heuristic remains within approximately 9.7% of the proposed MILP, demonstrating a favorable trade-off between energy efficiency and computational tractability. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-26 in cs.DC). Categorie arXiv: Information Theory (cs.IT) ; Distributed, Parallel, and Cluster Computing (cs.DC); Emerging Technologies (cs.ET); Performance (cs.PF); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.24841 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T06:17:57.842Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).