A Novel Algorithm for Embedding Dynamic Virtual Network Request

Most of the current researches in virtual network embedding field often assume that the VN requests are static. However, in practical cases, virtual network requests on substrate resources change dynamically over time. To support such dynamical feature, we model the VNE problem as a mixed linear programming problem and use multiple queues to store different types of virtual network requests respectively. The whole algorithm named VNE-DR is presented with optimization solution for different request types and multi queue scheduling. The approach allows multiple virtual nodes of the same virtual network can be embedded into the same physical node as long as there is enough resource capacity. Simulation results show that comparing with the existing virtual network embedding algorithms the proposed algorithm performs better in embedding cost.