AN ALGORITHMIC FRAMEWORK FOR PROTECTION SWITCHING IN WDM NETWORKS
AN ALGORITHMIC FRAMEWORK FOR PROTECTION SWITCHING IN WDM NETWORKS
In a WDM network, a single component failure may lead to multiple failures in the logical topology. Protection switching schemes that adopt traditional edge-disjoint or node-disjoint path-selection algorithms may not be able to protect the active connections properly. In this paper, we generalize the disjoint path problem by providing a framework that can model arbitrary types of failures, so that a solution to the problem can be applied to protection switching in WDM networks. We prove the nece