Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
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
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Ant Colony Optimization
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Survivable Mapping Algorithm by Ring Trimming (SMART) for Large IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
Ant-based survivable routing in dynamic WDM networks with shared backup paths
The Journal of Supercomputing
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
A scalable approach for survivable virtual topology routing in optical WDM networks
IEEE Journal on Selected Areas in Communications - Part Supplement
Hi-index | 0.00 |
The high capacity of fibers used in optical networks, can be divided into many channels, using the WDM technology. Any damage to a fiber causes all the channels routed through this link to be broken, which may result in a serious amount of data loss. As a solution to this problem, the virtual layer can be mapped onto the physical topology, such that, a failure on any physical link does not disconnect the virtual topology. This is known as the survivable virtual topology mapping problem. In this study, we investigated the performance of two popular nature inspired heuristics, namely, evolutionary algorithms and ant colony optimization, in finding a survivable mapping of a given virtual topology while minimizing the resource usage. Our results show that both nature inspired heuristics perform remarkably well for this problem. Furthermore, both methods can obtain high quality solutions in less than a minute.