Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Jianhua Tang, Tony Q.S. Quek, Tsung Hui Chang, Byonghyo Shim

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC.

Original languageEnglish
Article number8796390
Pages (from-to)7755-7770
Number of pages16
JournalIEEE Transactions on Communications
Volume67
Issue number11
DOIs
Publication statusPublished - 2019 Nov

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales'. Together they form a unique fingerprint.

Cite this