Optimum Network Slicing for Ultra-reliable Low Latency Communication (URLLC) Services in Campus Networks
By: Iulisloi Zacarias , Francisco Carpio , André Costa Drummond and more
Potential Business Impact:
Makes factory robots work perfectly, even when busy.
Within 3GPP, the campus network architecture has evolved as a deployment option for industries and can be provisioned using network slicing over already installed 5G public network infrastructure. In campus networks, the ultra-reliable low latency communication (URLLC) service category is of major interest for applications with strict latency and high-reliability requirements. One way to achieve high reliability in a shared infrastructure is through resource isolation, whereby network slicing can be optimized to adequately reserve computation and transmission capacity. This paper proposes an approach for vertical slicing the radio access network (RAN) to enable the deployment of multiple and isolated campus networks to accommodate URLLC services. To this end, we model RAN function placement as a mixed integer linear programming problem with URLLC-related constraints. We demonstrate that our approach can find optimal solutions in real-world scenarios. Furthermore, unlike existing solutions, our model considers the user traffic flow from a known source node on the network's edge to an unknown \textit{a priori} destination node. This flexibility could be explored in industrial campus networks by allowing dynamic placement of user plane functions (UPFs) to serve the URLLC.
Similar Papers
A Comprehensive Survey of 5G URLLC and Challenges in the 6G Era
Networking and Internet Architecture
Makes phones connect super fast and reliably.
Open RAN Slicing with Quantum Optimization
Networking and Internet Architecture
Quantum computers make 5G networks faster and more reliable.
URLLC for 6G Enabled Industry 5.0: A Taxonomy of Architectures, Cross Layer Techniques, and Time Critical Applications
Networking and Internet Architecture
Makes factories work perfectly, even with robots.