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

Niezi Mharsi; Makhlouf Hadji; Dusit Niyato; William Diego; Ruby Krishnaswamy

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

Niezi Mharsi ^{1, 2} Makhlouf Hadji ¹ Dusit Niyato ³ William Diego ⁴ Ruby Krishnaswamy ⁴

1 IRT SystemX - IRT SystemX

2 LTCI - Laboratoire Traitement et Communication de l'Information

3 Nanyang Technological University [Singapour]

4 Orange Labs [Chatillon]

Abstract : 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.

Document type :

Conference papers

Domain :

Computer Science [cs] / Networking and Internet Architecture [cs.NI]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01687712
Contributor : Niezi Mharsi <>
Submitted on : Thursday, January 18, 2018 - 4:39:47 PM
Last modification on : Wednesday, February 20, 2019 - 1:28:43 AM

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

Identifiers

Collections

Citation

Export

Metrics

232

Contact

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

Identifiers

Collections

Citation

Export

Share

Metrics

232

Contact