Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

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
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01687712
Contributor : Niezi Mharsi Connect in order to contact the contributor
Submitted on : Thursday, January 18, 2018 - 4:39:47 PM
Last modification on : Monday, April 11, 2022 - 2:00:02 PM

Identifiers

  • HAL Id : hal-01687712, version 1

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⟩

Share

Metrics

Record views

206