A novel dynamic survivable routing in WDM optical networks with/without sparse wavelength conversion

Authors:
Vinh Trong Le;Xiaohong Jiang;Son Hong Ngo;Susumu Horiguchi;Yasushi Inoguchi
Affiliations:
Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;School of Information Sciences, Tohoku University, Sendai, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Japan;School of Information Sciences, Tohoku University, Sendai, Japan;Center for Information Science, Japan Advanced Institute of Science and Technology and PRESTO, Japan Science and Technology Agency, Japan
Venue:
Optical Switching and Networking
Year:
2006

Citing 9
Cited 1

Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
An Efficient Algorithm for Determining the Length of the Longest Dead Path in a “LIFO” Branch-and-Bound Exploration Schema

ACM Transactions on Mathematical Software (TOMS)
Optical networks: a practical perspective

Optical networks: a practical perspective
Efficient algorithms for routing dependable connections in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks

IEEE/ACM Transactions on Networking (TON)
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithms in WDM Networks with Sparse Wavelength Conversion

IEICE - Transactions on Information and Systems
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
State-of-the-art progress in developing survivable routing schemes in mesh WDM networks

IEEE Communications Surveys & Tutorials

A Tabu Search algorithm for dynamic routing in ATM cell-switching networks

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report cycles (that are formed by two disjoint-link routes) into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without the time consuming process associated with current GA-based lightpath protection schemes. We further improve the performance of our algorithm by introducing a more advanced fitness function that is suitable for both the above networks. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieves a significantly lower blocking probability than the conventional survivable routing algorithms for all the cases we studied.