Heuristic Survivable Virtual Network Embedding Based on Node Migration and Link Remapping

Survivable virtual network embedding has been an hot issue in network virtualization research. Previous researches mainly use protection mechanisms to deal with this problem, which may bring excessive consumption to the substrate network. In this paper, the survivable virtual network embedding problem is considered as an integer linear programming model. We propose a heuristic survivable virtual network embedding based on node migration and link remapping to slove this problem. Artificial bee colony algorithm is used to achieve the optimal solution of virtual network embedding. If the substrate network node fails, we migrate the failed node to a normal node based on the greed rules first. Then, we use the shortest path to provide the best bandwidth principle to remap the affected links that connect with the failed node. The simulation results shows that our approach has better performance in the acceptance rate, recovery rate and the load strength than the existing solutions.