GA-based dynamic survivable routing in WDM optical networks with shared backup paths
Main Article Content
Abstract
Abstract. This paper considers the problem of dynamic survivable routing in WDM networks with
single link íailure model. This work mainly concems in how to dynamically đetermine a
protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable
lightpath with backup paths sharing. The problem is identified as NP-complcte, thus a heuristic for
fmding near optimal solution with reasonable computation timc is usually preferred. Inspired from
the principle of genetic algorithms (GA), a GA-based survivable routing algorithm for the problcm
with a new íìtness íunction, which allows us to improve blocking períormance, will be proposed.
Extensive simulation results upon the ns-2 network simulator and two typical netvvork topologics
show that our algorithm can achieve a signiíìcantly lower blocking probability than conventional
algorithms.
References
Transactions ơn Net\vorktng 3 (1995) 489.
[2 ] R. Ramamurthy, L. Sahasrabuddhc, B. Mukhcrjcc, Surviablc VVDM Mesh Nctworks, Journal o f Lightwave Technology'
21 (2003)870.
[3] G. Mohan, C.S.R. Murthy, A.K. Somani, Efficicnt Algorithms for Routing Dcpcndablc Conncctions in WDM Optical
Netvvorks, IEEE Transaciỉons on netuorking 9 (2001) 553.
[4] s. Yuan, J.p. Juc, Dynamic Lightpalh Protcction in WDM Mcsh Nctworks undcr Wavclcngtlì Continuity Constraint,
IEEE Gỉobecom (2004) 2019.
[5] p.lỉ. Ho, Statc-of-thc-Art Progrcss in Dcvcloping Survivablc Routing Schcmcs in Mcsh \VDM Nctworks, IEEE
Communications Surveys & Tuioriaỉs, \ o l . 6, no.4, 2004.
[ 6] D. Bisbal et al., Dynamic Rouling and Wavclcngth Assignmcnt in optical Nctworks by Mcans o f Gcnetic Algorithms,
Photonic Net\\orks Commumcations 1 (2004) 43.
[7] D.E. Goldbcrg, Gcnctic Algorithms in Scarch, Optimi/.ation, and Machine Lcaming, Addison-ỈVesley Pubĩishing
Company, Inc., 1997
[ 8 ] http://www.isi.cdu/nsnam/ns/indcx.himl, 2003.