Mapping the allocation of resources for 5G slices to the k-MUTEX with n instances of m resources problem

The introduction of slicing in 5G networks requires to consider the infrastructures as shared between not only users but also between independent services with heterogeneous requirements. This problem can be seen as a variation of the k-mutex problem. In this paper we introduce two contributions. First we propose a formulation of the problem of allocation of resource for 5G slicing. Then we present adaptation of an existing algorithm for a more general k-mutex problem to our problem and the experimental results of tests run in our simulator showing the performances compared to other algorithms.