This paper studies the multi-layers embedding problem of survivable virtual networks based on virtual network layer protection. We first establish an integer linear programming (ILP) for the SVNME problem. Then an efficient heuristic algorithm VNP-SVNME is proposed to solve the large-scale problem. Experiments show that the resource mapping cost of the VNP-SVNME algorithm is only 15% higher on average than the optimal solution
but it is better than the state-of-the-art heuristic. In addition
the time complexity is greatly reduced compared to ILP
which can meet the requirements of online virtual network mapping.