Efficient Survivable Mapping Design for Logical Topology in IP-over-WDM Optical Networks against Node Failure

Abstract

In an IP-over-WDM networks with logical graph GL and physical graph GP a surviv- able mapping problem is to find a mapping in physical layer so that any failure (node or link) in physical topology doesn’t break down the logical topology’s connection It is a NP-complete problem to determine whether a survivable mapping exists or not so many heuristic algorithms have been proposed Previous works shows they can protect link failure or node failure In this paper an heuristic mapping design strategy is proposed to let the lightpaths endure node failure more efficiently It uses relaxed hamiltonian cycle algorithm to cover all of the logical nodes After that it uses bipartite node disjoint mapping and cycle transformation iteratively in order to guarantee the connectivity and improve the survivability The simulation shows that our proposed algorithm can have a better performance for providing survivable mapping in IP-over-WDM networks

Date of Award	2016 Sept 5
Original language	English
Supervisor	Sun-Yuan Hsieh (Supervisor)