SRLG failure-disjoint path pair of min-sum cost in GMPLS networks

Network reliability can be implemented in several network layers. The concept of Shared Risk Link Group (SRLG) allows an upper layer to be capable of implementing SRLG diverse routing. If a given link is known to be protected, it can be omitted from the set of links to be avoided, when a SRLG disjoint protection path (or segment) for a given active path is calculated. An Integer Linear Programming Formulation for SRLG failure-disjoint path pair of min-sum problem, considering dedicated protection, is presented. Two heuristics for solving the min-sum SRLG failure-disjoint path problem, which are based on two already known algorithms for SRLG diverse routing are proposed and the resulting network performance in a reference network is presented. The envisaged application scenario of these routing algorithms is GMPLS networks with protected links.