Highly Available Path Routing in Mesh Networks Under Multiple Link Failures
We study the problem of maximizing path availability in mesh networks against simultaneous failures of multiple links without using protection schemes. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard, so we propose heuristic algorithms for networks with large numbers of SRLGs, as well as optimal solutions for networks with smaller numbers of SRLGs. The solutions are evaluated through simulations.
mesh network path availability shared risk link group (srlg) lightpath multiple failures