Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures

Consider the resilience of a network defined by the average 2-terminal reliability (A2TR) against a set of critical node failures. Consider an existing transparent optical network with a total fibre length L. The first goal of this paper is to assess the resiliency gap between the existing topology and a new network topology designed to maximize its resilience with the same fibre budget L. The resiliency gap gives us a measure of how good the resilience of existing network topologies are. Consider now that an existing network is upgraded with new links aiming to maximize its resiliency improvement with a fibre budget L′. The second goal of this paper is to assess how much the resiliency gap can be reduced between a good upgraded solution and a network topology designed to maximize its resiliency with the same fibre budget L + L′. The gap reduction gives us a measure of how close to the best resilience the upgraded solutions can get for different values of L′.To reach these goals, we first describe how the Critical Node Detection problem is defined and solved in the context of transparent optical networks. Then, we propose a multi-start greedy randomized method to generate network topologies, with a given fibre length budget, that are resilient to critical node failures. This method is also adapted to the upgrade of an existing network topology. At the end, we run the proposed methods on network topologies with public available information. The computational results show that the resiliency gap of existing topologies is significantly large but network upgrades with L′ = 10%L can significantly reduce the resiliency gaps provided that such upgrades are aimed at maximizing the network resilience to multiple node failures.

[1]  Amaro de Sousa,et al.  The Robust Node Selection Problem aiming to Minimize the Connectivity Impact of any Set of p Node Failures , 2017 .

[2]  Eytan Modiano,et al.  Assessing the Vulnerability of the Fiber Infrastructure to Disasters , 2009, IEEE INFOCOM 2009.

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

[4]  Amaro de Sousa,et al.  The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes , 2018, Electron. Notes Discret. Math..

[5]  Marjan Gusev,et al.  An overview of security challenges in communication networks , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[6]  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).

[7]  F. Rambach,et al.  A multilayer cost model for metro/core networks , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[8]  An Zeng,et al.  Enhancing network robustness for malicious attacks , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  R. Linsker,et al.  Improving network robustness by edge modification , 2005 .

[10]  José-Luis Marzo,et al.  Robustness Comparison of 15 Real Telecommunication Networks: Structural and Centrality Measurements , 2016, Journal of Network and Systems Management.

[11]  Paulo P. Monteiro,et al.  Compact Models for Critical Node Detection in Telecommunication Networks , 2018, Electron. Notes Discret. Math..

[12]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[13]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[14]  Amaro de Sousa,et al.  The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment , 2016, IEEE/ACM Transactions on Networking.

[15]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[16]  Eduardo L. Pasiliao,et al.  Critical nodes for distance‐based connectivity and related problems in graphs , 2015, Networks.

[17]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[18]  Lena Wosinska,et al.  Link addition framework for optical CDNs robust to targeted link cut attacks , 2017, 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM).

[19]  Massimo Tornatore,et al.  Progressive network recovery in optical core networks , 2015, 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM).

[20]  Eduardo L. Pasiliao,et al.  Exact identification of critical nodes in sparse networks via new compact formulations , 2014, Optim. Lett..

[21]  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).

[22]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[23]  Biswanath Mukherjee,et al.  Minimizing the Risk From Disaster Failures in Optical Backbone Networks , 2014, Journal of Lightwave Technology.

[24]  Marco Di Summa,et al.  Branch and cut algorithms for detecting critical nodes in undirected graphs , 2012, Computational Optimization and Applications.