Optimal Topology Management for Software-Defined Networks Minimizing Latency and Using Network Slicing

Abstract

In this paper, we analyze the problem of managing users from different slices connecting to a software-defined network (SDN). We seek to minimize the propagation latency between switches and controllers as well as between controllers themselves. We also minimize the connection latency between users and their network access nodes. Thus, the main highlights of the paper are to formally represent the problem utilizing two equivalent mixed-integer quadratic programming models. The first one represents the user requirements of each slice by using a membership matrix. The second one consists of subsets of users separated within each slice requirement. Subsequently, the above models are analyzed in a standard linearized version. Finally, they are compared with a proposed local search math-heuristic algorithm. The proposed models and algorithm are solved with the CPLEX solver with default options. To the best of our knowledge, this journal paper constitutes a first attempt to incorporate network slicing in SDN allowing flexibility, resource efficiency, security, and effective management of the network facilitating the deployment of customized and adaptive services. Besides, our models allow us to deal with the management of connecting users to either controller or switch-type nodes depending on the slice to which each user belongs. For security reasons, a certain slice could only have access to the network controllers, while the rest of the users that belong to the other slices can connect to the switch-type nodes of the network. From the numerical experiments, we observe that the linear models show a better performance in terms of CPU times and the best solutions obtained. Similarly, our proposed approximation algorithm achieves near-optimal solutions in significantly shorter CPU times, for all the input graph networks, when compared to the proposed exact models which allows for finding the optimal solutions.