Data-Driven C-RAN Optimization Exploiting Traffic and Mobility Dynamics of Mobile Users

被引:26
作者
Chen, Longbiao [1 ]
Nguyen, Thi-Mai-Trang [2 ]
Yang, Dingqi [3 ]
Nogueira, Michele [4 ]
Wang, Cheng [1 ]
Zhang, Daqing [5 ]
机构
[1] Xiamen Univ, Fujian Key Lab Sensing & Comp Smart Cities SCSC, Sch Informat, Xiamen 361005, Peoples R China
[2] Sorbonne Univ, CNRS, Lab Informat Paris LIP6 6, F-7606 Paris, France
[3] Univ Fribourg, EXascale Infolab, CH-1700 Fribourg, Switzerland
[4] Univ Fed Parana, BR-80060000 Curitiba, Parana, Brazil
[5] Inst Mines Telecom, Telecom SudParis, CNRS 5157, Paris, France
关键词
Handover; Optimization; Cellular networks; Computer architecture; Mobile computing; Base stations; Cellular network; C-RAN optimization; deep learning; big data analytics; RADIO ACCESS NETWORK; CLOUD; MODEL;
D O I
10.1109/TMC.2020.2971470
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The surging traffic volumes and dynamic user mobility patterns pose great challenges for cellular network operators to reduce operational costs and ensure service quality. Cloud-radio access network (C-RAN) aims to address these issues by handling traffic and mobility in a centralized manner, separating baseband units (BBUs) from base stations (RRHs) and sharing BBUs in a pool. The key problem in C-RAN optimization is to dynamically allocate BBUs and map them to RRHs under cost and quality constraints, since real-world traffic and mobility are difficult to predict, and there are enormous numbers of candidate RRH-BBU mapping schemes. In this work, we propose a data-driven framework for C-RAN optimization. First, we propose a deep-learning-based Multivariate long short term memory (MuLSTM) model to capture the spatiotemporal patterns of traffic and mobility for accurate prediction. Second, we formulate RRH-BBU mapping with cost and quality objectives as a set partitioning problem, and propose a resource-constrained label-propagation (RCLP) algorithm to solve it. We show that the greedy RCLP algorithm is monotone suboptimal with worst-case approximation guarantee to optimal. Evaluations with real-world datasets from Ivory Coast and Senegal show that our framework achieves a BBU utilization above 85.2 percent, with over 82.3 percent of mobility events handled with high quality, outperforming the traditional and the state-of-the-art baselines.
引用
收藏
页码:1773 / 1788
页数:16
相关论文
共 67 条
  • [1] Balanced graph partitioning
    Andreev, Konstantin
    Raecke, Harald
    [J]. THEORY OF COMPUTING SYSTEMS, 2006, 39 (06) : 929 - 939
  • [2] What Will 5G Be?
    Andrews, Jeffrey G.
    Buzzi, Stefano
    Choi, Wan
    Hanly, Stephen V.
    Lozano, Angel
    Soong, Anthony C. K.
    Zhang, Jianzhong Charlie
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (06) : 1065 - 1082
  • [3] [Anonymous], 2018, P IEEE C COMP COMM
  • [4] [Anonymous], 2013, Distributed Computing and Networking
  • [5] [Anonymous], 2016, GLOB MOB DAT TRAFF F
  • [6] [Anonymous], 2012, 2012 FUTURE NETWORK
  • [7] [Anonymous], 2011, C RAN ROAD GREEN RAN
  • [8] [Anonymous], 2012, ARXIV12100137
  • [9] Atsuyuki Okabe, 2016, INT ENCY GEOGRAPHY
  • [10] SET PARTITIONING - SURVEY
    BALAS, E
    PADBERG, MW
    [J]. SIAM REVIEW, 1976, 18 (04) : 710 - 760