A multi-domain virtual network embedding algorithm based on minimum cost

Aiming at the problem of the virtual network embedding in the multi-domain network environment, a multi-domain virtual network embedding algorithm (MC-VNE) based on the minimum cost is proposed. First, a feasible substrate node set is calculated for embedding each virtual node based on the constraints of the virtual network. Then, a feasible substrate path set is calculated for embedding each virtual link by using the minimum weight routing algorithm. Finally, on the basis of the Kruskal minimum spanning tree algorithm, the substrate path of the lowest weight is selected from the feasible substrate path set in turn, and the corresponding virtual link is then embedded into the selected substrate path in a proper order. Meanwhile, the corresponding virtual nodes are embedded in a harmonious way. Simulation results show that the MC-VNM algorithm reduces the resource cost of virtual network embedding effectively, and improves the acceptance ratio of virtual network requests. ©, 2015, South China University of Technology. All right reserved.