Survivable network design with shared-protection routing

DOI10.1016/J.EJOR.2014.04.047MaRDI QIDQ296897zbMATHOpenAlexFDO

Authors Y. K. Agarwal, Prahalad Venkateshan

Publication date 23 June 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2014.04.047

zbMATH Keywords

large scale optimizationcolumn generationend-to-end restoration schemesshared protection survivable network design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• Publication:4845372
• Hop constrained network design problem with partial survivability
• Large scale linear programs and heuristics for the design of survivable telecommunication networks
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Design of Survivable Networks: A survey

Cites work

• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• Complexity of column generation in network design with path-based survivability mechanisms
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
• Connectivity Upgrade Models for Survivable Network Design
• Design of survivable networks using three- and four-partition facets
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Metric inequalities and the network loading problem
• Minimum-weight two-connected spanning networks
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• On capacitated network design cut-set polyhedra
• Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
• Polyhedral structure of the 4-node network design problem
• Solving survivable two-layer network design problems by metric inequalities
• Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
• Strong inequalities for capacitated survivable network design problems.
• The convex hull of two core capacitated network design problems
• The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
• Using mixed-integer programming to solve power grid blackout problems
• k-Partition-based facets of the network design problem

Cited in

(14)

• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• A bootstrap heuristic for designing minimum cost survivable networks
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• SRG-disjoint design with dedicated and shared protection
• A survivable DoS-resistant overlay network
• Combinatorial optimization in networks with shared risk link groups
• Survivable green traffic engineering with shared protection
• Large scale linear programs and heuristics for the design of survivable telecommunication networks
• scientific article; zbMATH DE number 1757974 (Why is no real title available?)
• Near optimal design of wavelength routed optical networks
• Energy-aware survivable networks
• Multiobjective design of survivable IP networks
• Fast heuristics for protection networks for dynamic routing
• Heuristic algorithms for designing self-repairing protection trees in mesh networks

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: Survivable network design with shared-protection routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296897)