Robust optimization for designing reliable telecommunication networks with node failure scenarios

The design of telecommunication network concerns the selection of arcs in a graph with involved cost as low as possible, but satisfies constraints such as point-to-point demands routed across the network, arc capacity, hop constraints and so on. Such a design must allocate enough flows and diverse routing paths through the network to ensure that feasible information flows continue to exist, even when components of the network fail. In this paper, we propose a reliable mathematical model to optimally design a minimum-cost survivable telecommunication network that continues to support a good communication under any node failure scenario.