Vulnerability Evaluation of Networks to Multiple Failures Based on Critical Nodes and Links

In this chapter, we consider the vulnerability evaluation of a given network, composed by a set of nodes and a set of links, based on the connectivity still provided by the network if its critical elements fail simultaneously. This evaluation requires to solve the optimization problem of identifying the set of network elements (either nodes or links) that are the most critical in the sense that if they are removed from the network, the resulting connectivity is minimized. The chapter describes both exact methods based on integer linear programming and centrality-based heuristics. Although exact methods are preferable since they can provide optimal solutions, they do not scale for very large problem instances since the optimization problem is of combinatorial nature. In such cases, heuristics are alternative methods able to provide solutions that might be non-optimal. The chapter addresses separately the cases aiming to identify the set of critical nodes and the set of critical links. Computational results are provided enabling the comparison between exact methods and centrality-based heuristics in terms of solution optimality.

[1]  Lena Wosinska,et al.  On the Trade-offs between User-to-Replica Distance and CDN Robustness to Link Cut Attacks , 2018, 2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM).

[2]  Panos M. Pardalos,et al.  On New Approaches of Assessing Network Vulnerability: Hardness and Approximation , 2012, IEEE/ACM Transactions on Networking.

[3]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[4]  My T. Thai,et al.  Network Under Joint Node and Link Attacks: Vulnerability Assessment Methods and Analysis , 2015, IEEE/ACM Transactions on Networking.

[5]  Giuseppe F. Italiano,et al.  Computing Critical Nodes in Directed Graphs , 2018, ALENEX.

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

[7]  Mario Ventresca,et al.  Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem , 2012, Comput. Oper. Res..

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

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

[10]  Roberto Aringhieri,et al.  Hybrid constructive heuristics for the critical node problem , 2016, Annals of Operations Research.

[11]  Hugh R. Medal,et al.  Methods for removing links in a network to minimize the spread of infections , 2016, Comput. Oper. Res..

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

[13]  Amaro de Sousa,et al.  Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures , 2018, 2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM).

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

[15]  Simon Lovell,et al.  Phosphorylation of the Leukemic Oncoprotein EVI1 on Serine 196 Modulates DNA Binding, Transcriptional Repression and Transforming Ability , 2013, PloS one.

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

[17]  Hamamache Kheddouci,et al.  The Critical Node Detection Problem in networks: A survey , 2018, Comput. Sci. Rev..

[18]  Yannick Rochat,et al.  Closeness Centrality Extended to Unconnected Graphs: the Harmonic Centrality Index , 2009 .

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