Details

Autor(en) / Beteiligte

• Sen, Nabhasmita
• A, Antony Franklin

Titel

Slice Aware Baseband Function Placement in 5G RAN Using Functional and Traffic Split

Ist Teil von

• IEEE access, 2023, Vol.11, p.35556-35566

Ort / Verlag

Piscataway: IEEE

Erscheinungsjahr

2023

Quelle

EZB Electronic Journals Library

Beschreibungen/Notizen

• 5G and Beyond 5G (B5G) are undergoing numerous architectural changes to enable higher flexibility and efficiency in mobile networks. Unlike traditional mobile networks, baseband functions in 5G are disaggregated into multiple components - Radio Unit (RU), Distributed Unit (DU), and Centralized Unit (CU). These components can be placed in different geographical locations based on the latency sensitivity and available capacity in the network. Processing baseband functions in a centralized location offer various advantages (known as centralization benefit in RAN) to mobile network operators, which have been a point of interest for several research works. However, achieving maximum centralization is challenging due to various factors such as limited capacity in the midhaul network, delay requirement of different functional splits and network slices, etc. In this work, we aim to address these challenges by proposing a slice-aware baseband function placement strategy. Our primary objective is to maximize the degree of centralization in the network by appropriate selection of functional split. To achieve this objective, we jointly consider functional split, traffic split, different placement options for baseband functions, and network slice-specific requirements. We also consider the minimization of active processing nodes in cloud infrastructure of different levels (edge and regional) to provide additional resource efficiency. To this end, we formulate an optimization model using Mixed Integer Linear Programming (MILP) and compare its performance with different baseline techniques. We show that the proposed model achieves 6.5% more degree of centralization than the state-of-the-art while placing baseband functions in the network. To tackle the high computational complexity of the MILP model, we also present a polynomial-time heuristic algorithm for solving the problem in large-scale scenarios. We show that although the optimization model achieves around 4% more degree of centralization than the heuristic, the heuristic solves the problem in a reasonable amount of time, making it suitable for real deployment scenarios.