Scalable and Cost-Efficient Algorithms for Baseband Unit (BBU) Function Split Placement

Niezi Mharsi (1, 2) , Makhlouf Hadji (1) , Dusit Niyato (3) , William Diego (4) , Ruby Krishnaswamy (4)

1 IRT SystemX
2 LTCI - Laboratoire Traitement et Communication de l'Information
3 Nanyang Technological University [Singapour]
4 Orange Labs [Chatillon]

This paper considers the optimal placement of Baseband Unit (BBU) function split in Cloud Radio Access Networks (C-RANs) which is an essential key technology in C-RAN deployment. In particular, the BBU function split is modeled as directed chains to be mapped to a network infrastructure. As such, we propose an Integer Linear Program (ILP) formulation for small and medium size networks. Alternatively, we introduce four heuristic algorithms with significantly less complexity. We then benchmark the four heuristic algorithms based on the construction of a multi-stage graph. The simulation results strongly confirm the efficiency and scalability of our algorithms as well as their ability to achieve an optimal solution.

Domaines: Réseaux et télécommunications [cs.NI]

Niezi Mharsi, Makhlouf Hadji, Dusit Niyato, William Diego, Ruby Krishnaswamy. Scalable and Cost-Efficient Algorithms for Baseband Unit (BBU) Function Split Placement . WCNC 2018 : IEEE Wireless Communications and Networking Conference, Apr 2018, Barcelone, Spain. ⟨hal-01687712⟩