Abstract

Radio Access Network (RAN) disaggregation allows operators to mix-and-match multivendor components and bring RAN services from one end to the other. Despite this goal, issues of resource misuse or performance undershoot may arise because of inflexible RAN function deployment and uncoordinated decision-making across different network segments. To address these issues, this paper considers full flexibility in the synthesis of end-to-end RAN services from a set of disaggregated and uncoordinated components. In particular, five design factors are jointly considered to maximize the overall network spectral efficiency: (1) User association, (2) Remote radio unit clustering, (3) RAN functional split, (4) Fronthaul network routing, and (5) Baseband unit placement. To efficiently deal with the formulated problem, we propose a two-level turbo-based solution and compare its performance with several related works. The simulation results show that our proposed solution can not only achieve a 1.33-times spectral efficiency gain compared with state-of-the-art methods, but also provides 1.27 and 1.74 multiplexing benefits for computing and networking resources, respectively.

Highlights

  • R ADIO Access Network (RAN) is traditionally planned in a distributed and decentralized manner, and it has been referred to as Distributed RAN (D-RAN) since the 3G/4G era

  • Data are transported over the FH link according to the applied functional splits, such as the options defined by third Generation Partnership Project (3GPP) and by Common Public Radio Interface (CPRI) initiative as enhanced CPRI

  • We can see that RRU clusters are formed to facilitate a joint Coordinated Multi-Point (CoMP) processing, and RRUs within the same RRU cluster will apply the same functional split and be anchored to the same BaseBand Units (BBUs). Note that this RRU clustering operation shall be executed dynamically [19] to deal with time-varying air-interface interference as well as transport FH traffic flows over the dynamic bandwidth allocated by Software-Defined Networking (SDN) controller

Read more

Summary

INTRODUCTION

R ADIO Access Network (RAN) is traditionally planned in a distributed and decentralized manner, and it has been referred to as Distributed RAN (D-RAN) since the 3G/4G era. The BBU handles the remaining network function processing, and a disaggregated RAN architecture is formed1 In this regard, data are transported over the FH link according to the applied functional splits, such as the options defined by third Generation Partnership Project (3GPP) and by CPRI initiative as enhanced CPRI (eCPRI). Five design factors are considered together in this work to unleash the full potential of a disaggregated RAN deployment: (1) RRU clustering, (2) User association, (3) RAN functional split, (4) FH network routing, and (5) BBU placement. To retain better performance for associated end-users, we can form a large RRU cluster to coordinate processing from multiple RRUs at the cost of a large FH link capacity and a powerful anchor BBU processing capability To counter this cost, a less-centralized function split can be applied between the RRU cluster and its anchor BBU.

KNOWLEDGE AND RELATED WORK
RELATED WORK
NETWORK TOPOLOGY
USER ASSOCIATION AND RRU CLUSTERING
PROBLEM FORMULATION AND ANALYSIS
PROBLEM CONSTRAINTS
EXPECTED SINR FORMULATION
PROBLEM REFORMULATION AND PROPOSED SOLUTION
PERFORMANCE EVALUATIONS
VIII. CONCLUSIONS
DERIVATION OF SINR FOR SOFT SYMBOL COMBINATION
Findings
DERIVATION OF EXPECTED SINR

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.