The network design problem with reliability constraints is a problem where, given a finite set of nodes, the objective is a cost-efficient selection of links and link capacities sufficient to satisfy the node-to-node traffic demands in normal and failed conditions. In this paper, we present a general mathematical model for this problem and a revised formulation which seems particularly appropriate for Fiberoptics networks. We also describe upper and lower bounding procedures based on continuous relaxations of this modified formulation. Preliminary computational results are reported; they seem to indicate that the proposed bounds might prove suitable for a branch-and-bound approach of the problem.
|Original language||English (US)|
|Number of pages||7|
|Journal||IEEE Journal on Selected Areas in Communications|
|State||Published - Oct 1989|
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering