An exact VNE algorithm based on optimization theory

Abstract

The main challenge in network visualization is known as so called virtual network embedding(VNE). Most proposed VNE algorithms are heuristic so far in the literature. This paper presents an exact algorithm based on the Integer Linear Programming(ILP) of optimization theory. The exact algorithm VNE-ILP is able to simultaneously map virtual nodes and virtual links of VNRs. The constraint of virtual link delay, not included in former VNE study, is realized in the VNE-ILP. The goals of VNE-ILP are to consume less substrate resources and achieve less average virtual link delay. Numerical trials are made and simulation results reveal that the VNE-ILP outperforms the state of art heuristics.