Salience-based VNF placement method for evolving multiple network slices

Abstract

Network Function Virtualization (NFV) technology enables the deployment of a distinct network slice composed of various virtualized network functions (VNFs) required for offering a communication service. As the user population or network traffic volume fluctuates, the capacity of the network slices must be dynamically adjusted. It is necessary to decide whether to place VNFs in appropriate locations such that the quality of services (QoS) is guaranteed while optimally utilizing the allocated resources. The above challenge can be addressed by solving an optimization problem, such as integer linear programming. However, as solving the optimization problem requires a considerable amount of time, it is not applicable in agile network control mechanisms. In this paper, we propose a network function placement algorithm based on salience, which is one of the characteristic metrics of links in a graph. Our proposal is aimed to provide the adequate placement in short time to achieve the following objectives of keeping the slice reconstruction cost low and avoiding the cases of QoS degradation. The simulation results show that our scheme performs equally well for different sized slices (i.e., the user population). We found that the network reconfiguration costs are low and almost the same for various sized slices when they are reconstructed by the proposed method in a substrate network of 200 nodes. Furthermore, we confirmed that the proposed method keeps the slice reconstruction cost low and avoids blocking of slice reconstruction even in the situations when a resource competition occurs among multiple slices.