Network Defensive Strategy Definition Based on Node Criticality

In this paper we develop a novel approach to identify the best policy to allocate protection resources to raise the overall network robustness to node disruption. The proposed methodology is based on the identification of the most critical elements of the network in terms of their connectivity contribution to the entire system. The definition of the critical nodes is performed as a game-theoretic analysis based on Shapley Value theory. We validate the proposed approach with respect to a case study featuring a social network; by comparison with state of the art metrics, we experimentally show that the proposed protection strategy is particularly effective in preserving the residual network connectivity.

[1]  Y. Censor.  Pareto optimality in multiobjective problems , 1977 .

[2]  Simona Bernardi,et al.  A Min-Max Problem for the Computation of the Cycle Time Lower Bound in Interval-Based Time Petri Nets , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[3]  Wayne Pullan,et al.  Heuristic identification of critical nodes in sparse real-world graphs , 2015, J. Heuristics.

[4]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[5]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Hongzhong Deng,et al.  Vulnerability of complex networks under intentional attack with incomplete information , 2007 .

[7]  L. Shapley,et al.  The Shapley Value , 1994 .

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

[9]  Amir Bashan,et al.  Localized attacks on spatially embedded networks with dependencies , 2015, Scientific Reports.

[10]  Nam P. Nguyen,et al.  On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability , 2013, IEEE/ACM Transactions on Networking.

[11]  Marco Tomassini,et al.  Generating Robust and Efficient Networks Under Targeted Attacks , 2015, Propagation Phenomena in Real World Networks.

[12]  Mark A. Shayman,et al.  On pairwise connectivity of wireless multihop networks , 2007, Int. J. Secur. Networks.

[13]  R. Myerson.  Conference structures and fair allocation rules , 1978 .

[14]  Stefano Panzieri,et al.  Finding critical nodes in infrastructure networks , 2017, Int. J. Crit. Infrastructure Prot..

[15]  Valdis E. Krebs,et al.  Mapping Networks of Terrorist Cells , 2001 .

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

[17]  Harry Eugene Stanley,et al.  Percolation of localized attack on complex networks , 2014, ArXiv.

[18]  Masaharu Munetomo,et al.  Network Structural Vulnerability: A Multiobjective Attacker Perspective , 2019, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[19]  Beatrice M. Ombuki-Berman,et al.  An Experimental Evaluation of Multi-objective Evolutionary Algorithms for Detecting Critical Nodes in Complex Networks , 2015, EvoApplications.