Network Under Joint Node and Link Attacks: Vulnerability Assessment Methods and Analysis

Critical infrastructures such as communication networks, electrical grids, and transportation systems are highly vulnerable to natural disasters and malicious attacks. Even failures of few nodes or links may have a profound impact on large parts of the system. Traditionally, network vulnerability assessment methods separate the studies of node vulnerability and link vulnerability, and thus ignore joint node and link attack schemes that may cause grave damage to the network. To this end, we introduce a new assessment method, called β-disruptor, that unifies both link and node vulnerability assessment. The new assessment method is formulated as an optimization problem in which we aim to identify a minimum-cost set of mixed links and nodes whose removal would severely disrupt the network connectivity. We prove the NP-completeness of the problem and propose an O(√{logn}) bicriteria approximation algorithm for the β-disruptor problem. This new theoretical guarantee improves the best approximation results for both link and node vulnerability assessment in literature. We further enhance the proposed algorithm by embedding it into a special combination of simulated annealing and variable neighborhood search method. The results of our extensive simulation-based experiments on synthetic and real networks show the feasibility and efficiency of our proposed vulnerability assessment methods.

[1]  Alan T. Murray,et al.  A Methodological Overview of Network Vulnerability Analysis , 2008 .

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

[3]  Taieb Znati,et al.  On Approximation of New Optimization Methods for Assessing Network Vulnerability , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[5]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[6]  Nasser Fard,et al.  Cutset enumeration of network systems with link and node failures , 1999 .

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

[8]  Elad Hazan,et al.  O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  My T. Thai,et al.  Precise structural vulnerability assessment via mathematical programming , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[10]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[11]  Sanjeev Arora,et al.  O( p logn) Approximation to Sparsest Cut in O(n2) Time , 2004, FOCS 2004.

[12]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[13]  Juan C. Meza,et al.  Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid , 2010, SIAM J. Optim..

[14]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  Arunabha Sen,et al.  Region-based connectivity - a new paradigm for design of fault-tolerant networks , 2009, 2009 International Conference on High Performance Switching and Routing.

[17]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[19]  Marina Meila,et al.  Clustering by weighted cuts in directed graphs , 2007, SDM.

[20]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[21]  Elad Hazan,et al.  O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, SIAM J. Comput..

[22]  Jonathan Cole Smith,et al.  Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs , 2012, Networks.

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

[24]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[25]  Alan T. Murray,et al.  Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure , 2010, Comput. Oper. Res..

[26]  James Demmel,et al.  A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..

[27]  Alan T. Murray,et al.  Comparative Approaches for Assessing Network Vulnerability , 2008 .

[28]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[29]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[30]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[31]  B. Bollobás The evolution of random graphs , 1984 .

[32]  Gil Zussman,et al.  The resilience of WDM networks to probabilistic geographical failures , 2011, INFOCOM 2011.

[33]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[34]  V. Klee,et al.  Combinatorial and graph-theoretical problems in linear algebra , 1993 .

[35]  Arunabha Sen,et al.  Design and Analysis of Networks with Large Components in Presence of Region-Based Faults , 2011, 2011 IEEE International Conference on Communications (ICC).

[36]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

[38]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.