Results

**1 - 1**of**1**### Design of survivable networks with vulnerability constraints

, 2015

"... We consider the Network Design Problem with Vulnerability Constraints (NDPVC) which simul-taneously addresses resilience against failures (network survivability) and bounds on the lengths of each communication path (hop constraints). Solutions to the NDPVC are subgraphs containing a path of length a ..."

Abstract
- Add to MetaCart

(Show Context)
We consider the Network Design Problem with Vulnerability Constraints (NDPVC) which simul-taneously addresses resilience against failures (network survivability) and bounds on the lengths of each communication path (hop constraints). Solutions to the NDPVC are subgraphs containing a path of length at most Hst for each commodity {s, t} and a path of length at most H st between s and t after at most k edge failures. We first show that a related and well known problem from the literature, the Hop-Constrained Survivable Network Design Problem (kHSNDP), that addresses the same two measures produces solutions that are too conservative in the sense that they might be too expensive in practice or may even fail to provide feasible solutions. We also explain that the reason for this difference is that hop-constrained Mengerian theorems do not hold in general. Three graph theoretical characterizations of feasible solutions to the NDPVC are derived and used to propose integer linear programming formulations. In a computational study we compare these alternatives with respect to the lower bounds obtained from their linear programming relaxation and their capability of solving instances to proven optimality. In addition, we show that in many cases, the obtained solutions are cheaper than those obtained by the related problem previously suggested.