Network Survivability for a Regular WDM Optical Network From Double-Link Failures Using Greedy Algorithm

Network survivability is an important requirement in high-speed optical networks. The survivability of these networks from the failure of a single component such as a link or a node needs some typical approaches. In this paper, one have considered double-link failures in a hypercube optical network and present three loopback methods suggested by the researchers for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each link for rerouting traffic when a pair of links fails. These methods require the identification of the failed links before recovery can be completed. The third method requires the pre-computation of a single backup path and does not require link identification before recovery.