An exact VNE algorithm based on Integer Linear Programming

One main challenge in network virtualization is known as virtual network embedding(VNE). VNE is NP-hard and most algorithms in the literature are heuristic. This paper presents an exact algorithm based on the Integer Linear Programming(ILP). The exact algorithm aims to simultaneously minimize the cost of substrate network and average virtual link delay of mapped VNRs. Simulation results reveal that the exact solution VNE-ILP outperforms the state of art heuristics in terms of VNR acceptance ratio and average virtual link delay.