Design of survivable IP-over-optical networks

DOI10.1007/S10479-006-0047-2MaRDI QIDQ863570zbMATH OpenOpenAlexFDO

Authors Sylvie Borne, Eric Gourdin, Bernard Liau, A. R. Mahjoub

Publication date 5 February 2007

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0047-2

zbMATH Keywords

integer programmingsurvivabilityBranch-and-Cut algorithmIP-over-optical network

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Recommendations

• Multilayer survivable optical network design
• Multiobjective design of survivable IP networks
• Optimization techniques for survivable optical networks
• Multi-hour design of survivable classical IP networks

Cites work

• scientific article; zbMATH DE number 2084781 (Why is no real title available?)
• scientific article; zbMATH DE number 795223 (Why is no real title available?)
• scientific article; zbMATH DE number 2196281 (Why is no real title available?)
• A new approach to the maximum-flow problem
• A polyhedral approach to multicommodity survivable network design
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Design of survivable networks
• Introduction to ABACUS -- a branch-and-cut system
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Multi-Terminal Network Flows
• On two-connected subgraph polytopes
• Optimal attack and reinforcement of a network
• Separating from the dominant of the spanning tree polytope
• TSPLIB—A Traveling Salesman Problem Library
• The convex hull of two core capacitated network design problems
• Two-edge connected spanning subgraphs and polyhedra
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(19)

• Backbone network architectures for IP optical networking
• Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
• A new branch-and-cut approach for the generalized regenerator location problem
• Multi-hour design of survivable classical IP networks
• Design of Survivable Networks: A survey
• scientific article; zbMATH DE number 1696669 (Why is no real title available?)
• scientific article; zbMATH DE number 1950519 (Why is no real title available?)
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• Two-level evolutionary approach to the survivable mesh-based transport network topological design
• The design of transparent optical networks minimizing the impact of critical nodes
• Solving survivable two-layer network design problems by metric inequalities
• Multiobjective design of survivable IP networks
• Survivability issues in IP-MPLS networks
• Survivability issues in IP-MPLS networks
• Design of communication networks with survivability constraints
• Multilayer survivable optical network design
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
• A polyhedral study of the capacity formulation of the multilayer network design problem
• Hop-constrained node survivable network design: An application to MPLS over WDM

Describes a project that uses

Uses Software

• ABACUS
• TSPLIB

This page was built for publication: Design of survivable IP-over-optical networks

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