A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints

As more mission critical services are transported over high-speed networks, it is important to study the service quality and correlations among multiple link/node networks. In this paper, we propose a novel algorithm called Low Cost an S-Disjoint (LCSD) paths algorithm. The algorithm is based on a SRLG disjoint active and backup paths for network protection. The backup path can be used to avoid the risk sharing with active path. We conduct theoretical analysis and experiments. The results show that LCSD algorithm can be used to solve both trap problem and path-pair total-cost non-optimal problem under SRLG disjoint constraint. Compared with RF and TF algorithms, the LCSD algorithm is of significant superiority in a ratio to find feasible solution. It can guarantee minimum total cost of active and backup path.