Title: Optimising the multiplexing gain in Cloud RAN using the minimum spanning tree algorithm

Authors: Remigiusz Prokopiak

Addresses: Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland

Abstract: The cloud radio access network (Cloud-RAN) has been proposed as a cost efficient way of serving the increasing mobile traffic. The basic idea, supporting the cost efficiency, is the statistical multiplexing gain. Such a gain can be achieved when reusing the same processing power, realising BBU functions, for different, spatially distributed cells. Cells served by a single BBU pool need to be close to each other to support the mobility (handovers) and improve coordination. This article proposes the clustering algorithm, based on the minimum spanning tree (MSP). The algorithm allocates the geographically distributed sites onto a predefined set of BBU pools, keeping the clusters compact while achieving high multiplexing gain. We created, using the described algorithm, the BBU pools based on data traffic statistics from commercial network. We compared the multiplexing gain achieved with the maximum multiplexing gain achievable having given the daily profiles of analysed sites.

Keywords: baseband unit; BBU; BBU pooling; radio access network; Cloud-RAN; minimum spanning tree; statistical multiplexing gain; pooling gain.

DOI: 10.1504/IJMNDI.2019.107703

International Journal of Mobile Network Design and Innovation, 2019 Vol.9 No.3/4, pp.192 - 200

Received: 16 Nov 2019
Accepted: 18 Nov 2019
Published online: 09 Jun 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article