Cost Efficient Design of Survivable Virtual Infrastructure to Recover from Facility Node Failures

As network virtualization becomes popular, the problem of efficiently mapping a virtual infrastructure (VI) over a substrate network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, we study the survivable VI mapping problem to recover from facility node failures. We develop two solutions namely the 1-redundant scheme and the K-redundant scheme for surviving facility node failures while minimizing network resource costs. We also model the two schemes as a MILP problem and propose efficient heuristics based on the MILP formulations. We compare the efficiency of our solutions using simulation under various performance metrics.