Title :
Heuristic algorithms for finding reliable lightpath under multiple failures
Author :
Yuan, Shengli ; Waller, William ; Delavina, Ermelinda
Author_Institution :
Dept. of Comput. & Math. Sci., Univ. of Houston - Downtown, Houston, TX, USA
Abstract :
In this work, we study the NP-hard problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links. The fiber links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. We study three heuristic algorithms and evaluate their performance through simulations.
Keywords :
communication complexity; optical fibre networks; optical links; optimisation; probability; telecommunication network reliability; NP-hard problem; arbitrary failure probabilities; fiber link failures; heuristic algorithms; lightpath reliability maximisation; optical mesh networks; shared risk link groups; Computer network reliability; Computer networks; Heuristic algorithms; NP-hard problem; Optical computing; Optical fiber devices; Optical fiber networks; Protection; Resource management; Telecommunication network reliability;
Conference_Titel :
Ultra Modern Telecommunications & Workshops, 2009. ICUMT '09. International Conference on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4244-3942-3
Electronic_ISBN :
978-1-4244-3941-6
DOI :
10.1109/ICUMT.2009.5345552
