Creating and sharing knowledge for telecommunications

Determination of the Minimum Cost Pair of D-Geodiverse Paths

Sousa, A. F. ; Santos, D. ; Monteiro, P.

Determination of the Minimum Cost Pair of D-Geodiverse Paths, Proc Int. Conf. on Design of Reliable Communication Networks DRCN, Munich, Germany, Vol. , pp. 101 - 108, March, 2017.

Digital Object Identifier:


Consider a geographical network with associated link costs and a distance parameter D. The minimum cost pair of D-geodiverse paths (MCPD-GP) is the minimum cost pair of paths, from a given source node to a given destination node, such that the geographical distance between any intermediate element (node or link) of one path and any element of the other path is at least D. Such a solution has the property that any disaster based failure with a coverage diameter below D affecting one or more intermediate elements of one path cannot affect any element of the other path, enhancing in this way the network robustness to disaster based failures. A related problem is to compute, for a given network and a given source-destination node pair, the maximum distance D such that a pair of D-geodiverse paths exists. In this paper, we show how both problems can be modelled and efficiently solved through integer linear programming. We also extend the MCPD-GP problem to consider the existence of vulnerability regions, where the geographical distance D is only imposed between network elements belonging to the same region.