Technology Category
Planning, Routing, and Scheduling: Planning under UncertaintySearch and Optimization: Combinatorial OptimizationConstraint Satisfaction and Optimization: Distributed CSP/Optimization
Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection
🤖 AI Summary
This paper addresses the Shared Risk Link Group (SRLG)-constrained dual-path reliable routing problem—i.e., computing an optimal primary/backup path pair resilient to SRLG failures. We propose a dynamic pruning method grounded in statistical analysis of path cost distributions, replacing conventional conflict-link elimination with iteratively refined cost bounds. The approach integrates graph algorithms and operations research principles, incorporating iterative bound tightening, statistically guided path sampling, and constraint-satisfying search. Experiments demonstrate that, within fixed time limits, our method identifies significantly more SRLG-disjoint feasible path pairs than state-of-the-art approaches, achieving substantial improvements in both solution coverage and search efficiency. The key innovation lies in the first application of statistical modeling of path cost distributions to SRLG-aware dual-path optimization, enabling efficient and robust reliable routing.
Technology Category
Application Category
📝 Abstract
The search for the optimal pair of active and protection paths in a network with Shared Risk Link Groups (SRLG) is a challenging but high-value problem in the industry that is inevitable in ensuring reliable connections on the modern Internet. We propose a new approach to solving this problem, with a novel use of statistical analysis of the distribution of paths with respect to their cost, which is an integral part of our innovation. The key idea in our algorithm is to employ iterative updates of cost bounds, allowing efficient pruning of suboptimal paths. This idea drives an efficacious exploration of the search space. We benchmark our algorithms against the state-of-the-art algorithms that exploit the alternative strategy of conflicting links exclusion, showing that our approach has the advantage of finding more feasible connections within a set time limit.
Problem
Research questions and friction points this paper is trying to address.
Optimize active and protection paths in SRLG networks
Use statistical analysis for cost-driven path pruning
Improve feasibility of connections within time limits
Innovation
Methods, ideas, or system contributions that make the work stand out.
Statistical analysis of path cost distribution
Iterative cost bounds updates for pruning
Efficient search space exploration technique
🔎 Similar Papers
No similar papers found.
