Parallel Architectures, Algorithms, and Networks, International Symposium on (2005)
Las Vegas, Nevada, USA
Dec. 7, 2005 to Dec. 9, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.8
Vinh Trong Le , Japan Advanced Institute of Science and Technology, Japan
Son Hong Ngo , Japan Advanced Institute of Science and Technology, Japan
Xiaohong Jiang , Tohoku University, Sendai, Japan
Susumu Horiguchi , Tohoku University, Sendai, Japan
Yasushi Inoguchi , JAIST and PRESTO, Japan Science and Technology Agency
Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the 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 diverse 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 requiring the time consuming process associated with current GA-based lightpath protection schemes. We furthermore improve the performance of our algorithm by introducing a more advanced fitness function. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieve a significantly lower blocking probability and a smaller execution time than the conventional survivable routing algorithms.
Wavelength-division-multiplexing, survivable routing, lightpath protection, mobile agents, genetic algorithms.
V. Trong Le, S. H. Ngo, S. Horiguchi, Y. Inoguchi and X. Jiang, "A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Las Vegas, Nevada, USA, 2005, pp. 484-489.