Algorithms for the diverse routing problem in WDM networks with shared risk link groups

In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future