Efficient Network Slicing with SDN and Heuristic Algorithm for Low Latency Services in 5G/B5G Networks

TL;DR: In this article , a modified A* algorithm that incorporates network quality of service parameters into a composite metric is proposed for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements.

Abstract: This paper presents a novel approach for network slicing in 5G backhaul networks, targeting services with low or very low latency requirements. We propose a modified A* algorithm that incorporates network quality of service parameters into a composite metric. The algorithm’s efficiency outperforms that of Dijkstra’s algorithm using a precalculated heuristic function and a real-time monitoring strategy for congestion management. We integrate the algorithm into an SDN module called a path computation element, which computes the optimal path for the network slices. Experimental results show that the proposed algorithm significantly reduces processing time compared to Dijkstra’s algorithm, particularly in complex topologies, with an order of magnitude improvement. The algorithm successfully adjusts paths in real-time to meet low latency requirements, preventing packet delay from exceeding the established threshold. The end-to-end measurements using the Speedtest client validate the algorithm’s performance in differentiating traffic with and without delay requirements. These results demonstrate the efficacy of our approach in achieving ultra-reliable low-latency communication (URLLC) in 5G backhaul networks.