A Routing Algorithm For Finding Low-Cost Pair of No-Shared-Risk Paths

摘要

In WDM optical networks, much attention has been paid to route provision and restoration. Path protection is a good mechanism for optical networks. For any connection, two diverse lightpaths should be given out, one as the primary path and the other as the protection path. The concept of Shared Risk Link Group (SRLG) has been introduced in optical networks, so in many times the two paths should be SRLG-disjoint. In this paper, we propose one heuristic algorithm named Low-cost Pair of SRLG-Disjoint Paths Algorithm (LPSD), which can compute two SRLG-disjoint paths at one time, and the total cost of the two paths is near optimal. Analysis and simulation are also given out.