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-to-end 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.

[1]  Biswanath Mukherjee,et al.  Disaster survivability in optical communication networks , 2013, Comput. Commun..

[2]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[3]  Teresa Gomes,et al.  Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks , 2007, Eur. J. Oper. Res..

[4]  Deep Medhi,et al.  Analysing GeoPath diversity and improving routing performance in optical networks , 2015, Comput. Networks.

[5]  M. Tornatore,et al.  Design of Disaster-Resilient Optical Datacenter Networks , 2012, Journal of Lightwave Technology.

[6]  Gil Zussman,et al.  The Resilience of WDM Networks to Probabilistic Geographical Failures , 2011, IEEE/ACM Transactions on Networking.

[7]  Eytan Modiano,et al.  Enhancing Network Robustness via Shielding , 2017, IEEE/ACM Transactions on Networking.

[8]  James P. G. Sterbenz,et al.  Critical region identification and geodiverse routing protocol under massive challenges , 2015, 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM).

[9]  B. S. Manoj,et al.  A Multi-Backup Path Protection scheme for survivability in Elastic Optical Networks , 2016 .

[10]  David Tipper,et al.  Resilient network design: challenges and future directions , 2014, Telecommun. Syst..

[11]  András Gulyás,et al.  On Measuring the Geographic Diversity of Internet Routes , 2017, IEEE Communications Magazine.

[12]  Piotr Cholda,et al.  Network Recovery, Protection and Restoration of Optical, SONET-SDH, IP, and MPLS [Book Review] , 2005, IEEE Communications Magazine.

[13]  David Tipper,et al.  The Spine concept for improving network availability , 2015, Comput. Networks.

[14]  Branko Mikac,et al.  On the influence of the underlying network topology on optical telecommunication network availability under shared risk link group failures , 2014, 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN).

[15]  Rita Girão-Silva,et al.  Minimizing the network availability upgrade cost with geodiversity guarantees , 2017, 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM).

[16]  Piet Van Mieghem,et al.  Finding Critical Regions and Region-Disjoint Paths in a Network , 2015, IEEE/ACM Transactions on Networking.

[17]  David Tipper,et al.  Measuring the survivability of networks to geographic correlated failures , 2014, Opt. Switch. Netw..

[18]  Sofie Verbrugge,et al.  RECODIS: Resilient Communication Services Protecting End-user Applications from Disaster-based Failures , 2016, 2016 18th International Conference on Transparent Optical Networks (ICTON).

[19]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[20]  Arunabha Sen,et al.  Software-defined adaptive survivability for elastic optical networks , 2017, Opt. Switch. Netw..

[21]  Dominic A. Schupke,et al.  A link-flow model for dedicated path protection with approximative availability constraints , 2006, IEEE Communications Letters.

[22]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[23]  Stefano Secci,et al.  A survey of strategies for communication networks to protect against large-scale natural disasters , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[24]  Santosfeqvm,et al.  A NEW ALGORITHM FOR RANKING LOOPLESS PATHS , 1997 .

[25]  Abdul Jabbar,et al.  Path diversification: A multipath resilience mechanism , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[26]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[27]  David Tipper,et al.  Supporting differentiated resilience classes in multilayer networks , 2016, 2016 12th International Conference on the Design of Reliable Communication Networks (DRCN).