Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience

Abstract

Telecommunication networks are a critical infrastructure of our society. Wide area backbone communication networks are based on optical networks, where each fiber has a very large capacity. These networks must offer high end-to-end availability and a high resilience to large-scale disasters. Routing with geodiversity can mitigate the impact of disasters but will result in longer paths, making it difficult to achieve the availability levels required by critical services. In this paper, we consider a given core optical network such that the current availability and the cost of upgrading it to a higher value are known for each network link (or edge). Then, the problem of selecting a set of edges to be upgraded at a minimum cost, while guaranteeing desired values of end-toend availability and geodiversity, is considered and formulated as an arc based integer non-linear programming model. The non-linear constraints of the model are approximated and linearized, resulting in a new ILP based heuristic. A filtering procedure is proposed for decreasing (if possible) the cost and the number of upgraded edges of the solutions obtained by previously proposed greedy heuristics and also by the ILP based heuristic. The relative performance of the heuristics is evaluated using different geodiverse distances and end-to-end availability values in two reference core optical networks.

A centrality-based heuristic for network design to support availability differentiation

“…The spine concept can also be used as part of a strategy for disaster preparedness. The work in [8] focuses on the minimization of the cost of upgrading edges to ensure a certain level of availability, where geodiversity [7] was also taken into account, in order for the network to be more disaster resilient. In [13], the concept of the spine as a high availability structure is used in a framework that also encompasses an additional upgrade of the availability of the edges, so that even after the most probable disaster events the network remains connected, allowing for the survivable routing layer to protect the connections.…”

Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios

“…Finally, and in order to reduce the cost required by extra resources to increase network resilience, a more conservative approach was discussed: instead of requiring a pair of paths to be fully disjoint, it would suffice to ensure the paths are disjoint in disaster-prone areas, while being allowed to share links and/or nodes in safer network regions. To conclude, we would like to recall that the algorithms presented in this chapter are often used as sub-routines for solving problems related to network resilience and/or to disaster-resilience such as in [10,15].…”

“…Algorithms for calculating the most available path pairs have also been proposed [14]. A description of an algorithm for calculating the most available path pair with geodiversity constraints can be found in [15] and in Chapter 3.2.…”

Robustness metrics for optical networks

“…Availability is associated with reliable network that the probability of network operations or network services will be ready at any time [25] since network traffic and communication in optical networks deal with high data transfer rate have complex network infrastructure [30]. Path Geodiversity considered in [41] is to enhance the Availability in the network services and believed to be disaster resilient. The authors discussed the value of Distance (D) has related to geodiversity, which assumes that a disjoint pair or routing paths is defined for each source-destination pair of nodes, and must be separated by a minimum distance, D. The authors addressed the problem using arc-based formulation in non-linear programming model and proposed Integer Liner Programming (ILP) model heuristic-based with the replacement of non-linear limitations.…”