Fast Restoration of Resilience-Guaranteed Segments Under Multiple Link Failures in a General Mesh-Type MPLS/GMPLS Network

Network resilience in MPLS/GMPLS networks has been receiving considerable attention. Most of the previous research on GMPLS recovery management has focused on efficient routing or signaling methods from single failures. Multiple simultaneous failures, however, may occur in a large-scale complex GMPLS network infrastructure. In this article, we derived the condition to test the existence of backup segments which satisfy the resilience constraint under multiple link failures, in a general mesh-type MPLS/GMPLS network. A decomposition theorem and a backup segment construction algorithm have been developed for the fast restoration of resilience-guaranteed backup segments, for the primary path with an arbitrary configuration. Finally, the simulation has been to show the efficiency of the proposed approach.