Maximum survivability under multiple failures

This paper investigates the maximum survivability problem in mesh networks with multiple failures. A heuristic algorithm is proposed to maximize the end-to-end survivability. Simulation results show that the algorithm proposed in this paper is always better than the bounds of two link-disjoint paths protection scheme.