Skip to Main content Skip to Navigation
Conference papers

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 - 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.
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01687712
Contributor : Niezi Mharsi <>
Submitted on : Thursday, January 18, 2018 - 4:39:47 PM
Last modification on : Wednesday, December 18, 2019 - 5:20:45 PM

Identifiers

  • HAL Id : hal-01687712, version 1

Collections

IRT-SYSTEMX | INSTITUT-TELECOM | PARISTECH | LTCI

Citation

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, April 2018 Barcelona, Spain, Apr 2018, Barcelone, Spain. ⟨hal-01687712⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

298

Contact

Informations

CCSD