Energy efficient virtual network embedding for path splitting

Multicommodity flow-based virtual network embedding algorithm does not consider link energy, which causes waste of energy. And its high time complexity can not meet real-time requirements of online virtual network embedding. In this paper, we find the dynamic inversion phenomenon, where revenue does not rely on embedding cost. Two novel link mapping algorithms are proposed for path splitting which based on the undirected network minimum cost flow. They enable link resource to consolidate and have low time complexity. Simulation results show that proposed algorithms reduce energy consumption and ensure real-time performance of online VN embedding.