Optimising the multiplexing gain in Cloud RAN using the minimum spanning tree algorithm Online publication date: Tue, 09-Jun-2020
by Remigiusz Prokopiak
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 9, No. 3/4, 2019
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook