Lightpath routing for maximum reliability in optical mesh networks

Abstract

We consider the problem of maximizing the reliability of connections in optical mesh networks against simultaneous failures of multiple fiber links that belong to a shared-risk link group (SRLG). We study the single-lightpath, parallel-lightpaths, and lightpath protection problems for connections between two end nodes, as well as the lightpath-ring problems for connections of three or more end nodes. We first study the special problems where all SRLGs have the same failure probability. In these problems, every SRLG is represented by a distinct color and every fiber link is associated with one or more colors, depending on the SRLGs to which the link belongs. We formulate the problems as minimum-color lightpath problems. By minimizing the number of colors on the lightpaths, the failure probability of the lightpaths can be minimized. We prove the problems to be NP-hard. We then extend the results to the general problems where the failure probabilities of the SRLGs may differ. Heuristic algorithms are proposed for larger instances of the problems, and the heuristics are evaluated through simulations.