An optimization model for communication networks with partial multiple failures

This paper studies optimization issues related to a proposed traffic protection strategy referred to as flow-thinning strategy (FTS). FTS is an extension of the well known protection concept, called path diversity, to the case of partial multiple link failures. Path diversity assumes that when a certain subset of links fail, then their capacity is entirely lost and the nominal path-flows that are not affected by the failure are sufficient to realize the required demand. FTS, in turn, is designed to work also when link failures are partial, that is, the failing links in general lose only a fraction of capacity. We consider a link dimensioning problem for FTS, called flow-thinning optimization problem (FTOP), and discuss its properties. It turns out that FTOP, in its general setting, is NP-hard so that its linear programming formulations are unavoidably non-compact and require path generation. As in the general case path generation is also difficult, we propose an integer programming formulation of the pricing problem for the general case of failure scenarios. We also exhibit two special cases when the pricing problem can be solved in polynomial time. Finally, we present a numerical study illustrating cost effectiveness of FTS. The considered partial multi-link failure scenarios are relevant for wireless networks and for the upper layers of fixed communication networks, as for example the MPLS layer with greedy elastic traffic demands. (Less)