Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
SNDlib 1.0—Survivable Network Design Library
Networks - Network Optimization (INOC 2007)
Finding failure-disjoint paths for path diversity protection in communication networks
IEEE Communications Letters
| Hi-index | 0.04 |
Given a set of commodities and a network where some arcs can fail while others are reliable, we consider a routing problem with respect to a survivability requirement that each commodity can be split among pairs of failure-disjoint paths. Two paths p and p^' form a pair of failure-disjoint paths if they share only reliable arcs. The same flow is sent over p and p^', but the flow sent on a common reliable arc is not doubled. We present a compact linear formulation of the problem. Also three non-compact formulations solvable by column generation are introduced. In the first formulation, the generated columns correspond to pairs of failure-disjoint paths, while in the second formulation the generated columns correspond to simple paths. The third formulation is solved by generating pairs of arc-disjoint paths. All formulations are compared numerically. On top of that we study some generalizations and some special cases of the problem of computing a shortest pair of failure-disjoint paths. One of these generalizations is equivalent to a single-commodity capacitated network design problem.