Optimised approach for VNF embedding in NFV

Abstract

The Virtual Network Function (VNF) embedding problem is important for service provision in the context of Network Function Virtualisation (NFV). However, this problem is proved to be NP-hard and challenging, and requires to be explored further. In this study, the authors first formulate it as an Integer Linear Programming (ILP) model for optimal solutions. Then, to compensate for the high running time of solving the ILP model, they propose a heuristic approach which fulfils the embedding process by jointly taking the global network connectivity and the local substrate node capacity into consideration. The simulation on real-world network topologies demonstrates that the proposed approach can provide solutions within 1.7 times of the optimal solution offered by ILP. In addition, the experiments also suggest that the proposed approach can provide up to 2.75 times reduction in the overall cost than the other benchmarks.