Reliability-guaranteed path protection under multiple constraints

The path protection with reliability guarantee is investigated under multiple constraints. The key challenge of providing ample multi-constrained loop-less paths to the detouring as candidates is addressed by a modified relaxation principle of dominated path. The loops in the new extended sub-paths are explored with an elastic depth, and additive criterions derived from the path information are adopted to obtain more accurate identification of feasible paths. Our hybrid detouring gives priority to the end to end disjoint backup paths and uses the residual space of inter-media nodes to store the potential local disjoint subpaths. The obtained candidate backup paths are selected by appropriate cost functions according to the combined reliability and the consumed resources. Simulation results demonstrate its superiority in restoration path-finding capability leads to a significant improvement in the success rate of the QoS path protection.