Heuristic algorithms for finding reliable lightpath under multiple failures

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.

• Type: Journal
• Year: 2009
• Where: ICUMT
• Authors: Shengli Yuan, William Waller, Ermelinda DeLa Viña
• Keywords: Communications, ICUMT 2009, Multiple Fiber Links, Optical Mesh Networks, Risk Link Groups