The Network Functions Virtualization (NFV) paradigm offers network operators benefits in terms of cost efficiency, vendor independence, as well as flexibility and scalability. However, in order to profit most from these features, new challenges in the area of management and orchestration of the virtual network functions (VNFs) need to be addressed.
In particular, this work deals with the VNF chain placement problem (VNFCP). For a given network situation, the task consists of determining the number, location, and assignment of VNF instances and the routing of demands. At the same time, several metrics like CPU utilization and the delay of individual flows need to be taken into account. For applicability in networks with dynamically changing conditions, algorithms need to explore the solution space of this NP-hard problem in a timely manner.
The contribution of this work is threefold: firstly, we design MO-VNFCP, a multi-objective heuristic for the VNFCP. Secondly, we investigate the convergence behavior of the algorithm in a case study. Finally, we provide a comparison between the proposed algorithm and an alternative approach from literature.