4.7 Article

Service Multiplexing and Revenue Maximization in Sliced C-RAN Incorporated With URLLC and Multicast eMBB

Journal

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
Volume 37, Issue 4, Pages 881-895

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSAC.2019.2898745

Keywords

URLLC; eMBB; multicast; C-RAN; network slicing

Funding

  1. Korea Research Fellowship Program through the National Research Foundation of Korea (NRF) through the Ministry of Science and Information and Communications Technology [2016H1D3A1938245]
  2. NRF grant through the Korean Government (MSIP) [2014R1A5A1011478]
  3. Singapore University of Technology and Design-Zhejiang University (SUTD-ZJU) Research Collaboration [SUTD-ZJU/RES/01/2016]
  4. SUTD-ZJU Research Collaboration [SUTD-ZJU/RES/05/2016]
  5. National Research Foundation of Korea [2016H1D3A1938245] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

The fifth generation (5G) wireless system aims to differentiate its services based on different application scenarios. Instead of constructing different physical networks to support each application, radio access network (RAN) slicing is deemed as a prospective solution to help operate multiple logical separated wireless networks in a single physical network. In this paper, we incorporate two typical 5G services, i.e., enhanced Mobile BroadBand (eMBB) and ultra-reliable low-latency communications (URLLC), in a cloud RAN (C-RAN), which is suitable for RAN slicing due to its high flexibility. In particular, for eMBB, we make use of multicasting to improve the throughput, and for URLLC, we leverage the finite blocklength capacity to capture the delay accurately. We envision that there will be many slice requests for each of these two services. Accepting a slice request means a certain amount of revenue (consists of long-term revenue and shot-term revenue) is earned by the C-RAN operator. Our objective is to maximize the C-RAN operator's revenue by properly admitting the slice requests, subject to the limited physical resource constraints. We formulate the revenue maximization problem as a mixed-integer nonlinear programming and exploit efficient approaches to solve it, such as successive convex approximation and semidefinite relaxation. Simulation results show that our proposed algorithm significantly saves system power consumption and receives the near-optimal revenue with an acceptable time complexity.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available