A Routing algorithm for finding low-cost pair of no-shared-risk paths

In optical network, for anyone connection in order to provide protection mechanism, not only one working path for the traffic flow should be computed, but also one backup path should be provided, and they should be physical-disjoint. This paper proposes one heuristic algorithm, which can compute two SRLG-disjoint paths simultaneously, and the total cost of the two paths is near optimal. In this paper, some simulations and analysis are also given out.