Efficient algorithms for survivable virtual network embedding

In this work we propose two decomposition algorithms LR-SVNE and D-SVNE for solving the SVNE problem efficiently. We focus on the design of survivable VN embedding with resource constraints. The VN embedding problem with resource constraints is NP-hard, hence most work focuses on devising heuristic solutions. Simulation results show that our algorithms perform well in terms of both time complexity and embedding cost.