A Parameterized and Optimized BBU Pool Virtualization Power Model for C-RAN Architecture

被引:0
作者
Al-Zubaedi, Wesam [1 ]
Al-Raweshidy, H. S. [1 ]
机构
[1] Brunel Univ London, Dept ECE, Wireless Networks & Commun Ctr WNCC, Uxbridge, Middx, England
来源
17TH IEEE INTERNATIONAL CONFERENCE ON SMART TECHNOLOGIES - IEEE EUROCON 2017 CONFERENCE PROCEEDINGS | 2017年
关键词
C-RAN; power consumption; power model; BBU-RRH mapping; vBBU; BIN-PACKING;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces a cost effective scheme for a Cloud Radio Access Network (C-RAN) based on virtualization, which is a technology used to reduce Power Consumption (PC) in the Base Band Unit (BBU pool). The BBU's function is proposed to be as a software application running in a servers, which is called the virtual BBU (vBBU). To asses the proposal scheme, a power model of the BBU pool is proposed for C-RAN architecture. This provides a parametrized and optimized linear power model, which cover all the individual aspects in the C-RAN system relevant for the PC analysis in the BBU pool. Moreover, in this work a New Minimum Bin Slack (NMBS) algorithm is proposed, which combines with the Bin Packing Method (BPM) to minimize the number of vBBUs. The NMBS is aimed at matching the right amount of baseband processing load of Remote Radio Heads (RRHs) with load balancing as much as possible among all of the vBBUs, and switching off others. The baseband processing procedure for each vBBU is divided into N tasks, which can be processed by multiple vBBUs so as to offer system flexibility. The proposed architecture is based on integer linear programming for finding the minimum number of vBBUs. The simulation results show the NMBS effectively decreases the number of active vBBUs and decreases the PC in C-RAN when compared with other algorithms. In addition, this algorithm reduced the average PC in the BBU pool by 65%, 6%, and 3% less than for the Distributed Baseline (DB), the First Fit Decreasing (FFD) algorithm and the Heuristic Simulating Annealing (HSA) algorithm, respectively.
引用
收藏
页码:38 / 43
页数:6
相关论文
共 18 条
  • [1] [Anonymous], 2011, CISC VIS NETW IND GL
  • [2] Arouk O., 2016, IEEE J SEL AREA COMM, VPP
  • [3] HOW MUCH ENERGY IS NEEDED TO RUN A WIRELESS NETWORK?
    Auer, Gunther
    Giannini, Vito
    Desset, Claude
    Godor, Istvan
    Skillermark, Per
    Olsson, Magnus
    Imran, Muhammad Ali
    Sabella, Dario
    Gonzalez, Manuel J.
    Blume, Oliver
    Fehske, Albrecht
    [J]. IEEE WIRELESS COMMUNICATIONS, 2011, 18 (05) : 40 - 49
  • [4] Cloud RAN for Mobile Networks-A Technology Overview
    Checko, Aleksandra
    Christiansen, Henrik L.
    Yan, Ying
    Scolari, Lara
    Kardaras, Georgios
    Berger, Michael S.
    Dittmann, Lars
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2015, 17 (01) : 405 - 426
  • [5] Ferreira D. N. G., 2015, U PORTO J ENG VOL, V1, P35
  • [6] RESOURCE MANAGEMENT FOR SOFTWARE-DEFINED RADIO CLOUDS
    Gomez Miguelez, Ismael
    Marojevic, Vuk
    Gelonch Bosch, Antoni
    [J]. IEEE MICRO, 2012, 32 (01) : 44 - 53
  • [7] A new heuristic algorithm for the one-dimensional bin-packing problem
    Gupta, JND
    Ho, JC
    [J]. PRODUCTION PLANNING & CONTROL, 1999, 10 (06) : 598 - 603
  • [8] Minimizing Base Station Power Consumption
    Holtkamp, Hauke
    Auer, Gunther
    Bazzi, Samer
    Haas, Harald
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (02) : 297 - 306
  • [9] FAST ALGORITHMS FOR BIN PACKING
    JOHNSON, DS
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (03) : 272 - 314
  • [10] Khan M, 2015, 2015 EUROPEAN CONFERENCE ON NETWORKS AND COMMUNICATIONS (EUCNC), P169, DOI 10.1109/EuCNC.2015.7194062