Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
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
An algorithm for ranking quickest simple paths
Computers and Operations Research
Demand-wise Shared Protection for Meshed Optical Networks
Journal of Network and Systems Management
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Issues for routing in the optical layer
IEEE Communications Magazine
| Hi-index | 0.00 |
Link dimensioning and routing problems in resilient network design are considered. Reliable network operation is ensured by means of flow restoration which is performed on preselected protection (backup) paths that can absorb traffic overflows from failed primary paths. Backup and primary flows use separated link capacities, and can be split among many paths. In the paper, two restoration models are considered. The first model assumes that once the backup path is assigned it must be used in every state in which the protected primary path fails while the second model allows different protection paths to be used in different network failure states. The problems are formulated as multiple commodity linear programming (LP) models using the link-path (L-P) notation and solved by the column generation technique. Consequent pricing models and algorithms are introduced. Computational efficiency of the presented approaches is analyzed.