Simulation of URLLC slicing with resource reconfiguration in 5G networks

This thesis seeks to analyse the performance of dynamic slice provisioning in a 5G metro network with the low latency and reliability guaranties. This elaborate highlight the comparison in terms of performance of two versions of a simulator developed in Python based on different models: the Exhaustive research model and Shortest Path First Fit (SPFF) model. It further presents the differences between the dedicated path protection and the shared path protection. This analysis is made through several simulations at different network conditions by varying networks resources and observing the network performances while comparing the 2 models mentioned above. A reconfiguration procedure was implemented on backup resources in the shortest path first fit in order to improve its performance with respect to the exhaustive research which is more optimised. Subsequently, several triggering events was implemented, for the reconfiguration. And a comparison is made between these different triggering events in terms blocking probability, bandwidth at link, capacity at each node, primary and backup bandwidth per slice and backup capacity per slice.