Hop-constrained node survivable network design: An application to MPLS over WDM

DOI10.1007/s11067-007-9038-3zbMath1172.90339OpenAlexW2026420755MaRDI QIDQ1035728

Amaro de Sousa, Luís Gouveia, Pedro Patrício

Publication date: 4 November 2009

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-007-9038-3

zbMATH Keywords

survivabilityhop constraintsMPLS over WDM network design

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (16)

Length-bounded cuts: proper interval graphs and structural parameters ⋮ Layered graph approaches for combinatorial optimization problems ⋮ The \(q\)-ad hoc hub location problem for multi-modal networks ⋮ Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Unnamed Item ⋮ Risk approaches for delivering disaster relief supplies ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ Characterization of facets of the hop constrained chain polytope via dynamic programming ⋮ Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models ⋮ Further contributions to network optimization ⋮ A formulation for a hop constrained survivable network design problem

Cites Work

• Unnamed Item
• Design of survivable IP-over-optical networks
• Design of survivable networks
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Packet Routing in Telecommunication Networks with Path and Flow Restrictions
• Connectivity-splitting models for survivable network design
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• Strong formulations for network design problems with connectivity requirements
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem

This page was built for publication: Hop-constrained node survivable network design: An application to MPLS over WDM