Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure

The survivable mapping problem in an IP-over-WDM network with a logical graph and physical graph is the problem of finding a mapping of a logical network in a physical layer so that any failure in physical topology does not break the logical topology’s connection. Determining whether a survivable mapping against failure exists is an NP-complete problem, and therefore many heuristic algorithms have been proposed in the literature. In this paper, a heuristic mapping design strategy is proposed to enable the lightpaths to more efficiently endure a node failure. We individually consider the logical topology by building a Hamiltonian cycle and then deal with the mapping problem for disjoint physical paths. Experimental results demonstrate that the proposed algorithm can provide efficient survivable mapping in IP-over-WDM networks. The simulation shows that the survivability of previous methods (SNF and SMART-Node) is around 60–80%, but our proposed algorithm can build survivable mapping in all kinds of situations.