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.

Type de document :

Communication dans un congrès

WCNC 2018 : IEEE Wireless Communications and Networking Conference, April 2018 Barcelona, Spain, Apr 2018, Barcelone, Spain

Domaine :

Informatique [cs] / Réseaux et télécommunications [cs.NI]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01687712
Contributeur : Niezi Mharsi <>
Soumis le : jeudi 18 janvier 2018 - 16:39:47
Dernière modification le : mercredi 20 février 2019 - 01:28:43

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

Identifiants

Collections

Citation

Exporter

Métriques

222

Contact

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

Identifiants

Collections

Citation

Exporter

Partager

Métriques

222

Contact