Graph theory and its applications
Graph theory and its applications
Design of a Survivable WDM Photonic Network
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IEEE Journal on Selected Areas in Communications
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
Design protection for WDM optical networks
IEEE Journal on Selected Areas in Communications
Data-centric optical networks and their survivability
IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Performance analysis of nature inspired heuristics for survivable virtual topology mapping
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Survey on dependable IP over fiber networks
Dependable Systems
Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm
Optical Switching and Networking
Hi-index | 0.00 |
We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then try to gradually improve it. This involves the evaluation of the entire topology at each iteration, which is costly for large topologies. We propose a different approach. The SMART algorithm breaks down the task into a set of independent and very simple subtasks. The combination of solutions of these subtasks is a survivable mapping. This is why SMART is orders of magnitude faster than other proposals, especially when dealing with large topologies. We also extend the SMART algorithm to obtain a mapping resilient to fiber span failures, node failures and double-link failures. Finally, we show that the scalability of the standard heuristic approaches is additionally limited (contrary to SMART) when applied to double-link failures.