-
How Should I Orchestrate Resources of My Slices for Bursty URLLC Service Provision?
Future wireless networks are convinced to provide flexible and cost-effi...
read it
-
Blocking Probability Analysis for 5G New Radio (NR) Physical Downlink Control Channel
The 5th generation (5G) new radio (NR) is designed to support a wide ran...
read it
-
Towards Ultra-Reliable Low-Latency Communications: Typical Scenarios, Possible Solutions, and Open Issues
Ultra-reliable low-latency communications (URLLC) has been considered as...
read it
-
Reliable and Low-Latency Fronthaul for Tactile Internet Applications
With the emergence of Cloud-RAN as one of the dominant architectural sol...
read it
-
RAN Slicing for Massive IoT and Bursty URLLC Service Multiplexing: Analysis and Optimization
The radio access network (RAN) is regarded as one of the potential propo...
read it
-
Multi-Cell, Multi-Channel URLLC with Probabilistic Per-Packet Real-Time Guarantee
Ultra-reliable, low-latency communication (URLLC) represents a new focus...
read it
-
Rician K-Factor-Based Analysis of XLOS Service Probability in 5G Outdoor Ultra-Dense Networks
In this report, we introduce the concept of Rician K-factor-based radio ...
read it
Multicast eMBB and Bursty URLLC Service Multiplexing in a CoMP-Enabled RAN
This paper is concerned with slicing a radio access network (RAN) for simultaneously serving two typical 5G and beyond use cases, i.e., enhanced mobile broadband (eMBB) and ultra-reliable and low latency communications (URLLC). Although many researches have been conducted to tackle this issue, few of them have considered the impact of bursty URLLC. The bursty characteristic of URLLC traffic may significantly increase the difficulty of RAN slicing on the aspect of ensuring a ultra-low packet blocking probability. To reduce the packet blocking probability, we re-visit the structure of physical resource blocks (PRBs) orchestrated for bursty URLLC traffic in the time-frequency plane based on our theoretical results. Meanwhile, we formulate the problem of slicing a RAN enabling coordinated multi-point (CoMP) transmissions for multicast eMBB and bursty URLLC service multiplexing as a multi-timescale optimization problem. The goal of this problem is to maximize multicast eMBB and bursty URLLC slice utilities, subject to physical resource constraints. To mitigate this thorny multi-timescale problem, we transform it into multiple single timescale problems by exploring the fundamental principle of a sample average approximation (SAA) technique. Next, an iterative algorithm with provable performance guarantees is developed to obtain solutions to these single timescale problems and aggregate the obtained solutions into those of the multi-timescale problem. We also design a prototype for the CoMP-enabled RAN slicing system incorporating with multicast eMBB and bursty URLLC traffic and compare the proposed iterative algorithm with the state-of-the-art algorithm to verify the effectiveness of the algorithm.
READ FULL TEXT
Comments
There are no comments yet.