Bound and exact methods for assessing link vulnerability in complex networks

Assessing network systems for failures is critical to mitigate the risk and develop proactive responses. In this paper, we investigate devastating consequences of link failures in networks. We propose an exact algorithm and a spectral lower-bound on the minimum number of removed links to incur a significant level of disruption. Our exact solution can identify optimal solutions in both uniform and weighted networks through solving a well-constructed mixed integer program. Also, our spectral lower-bound derives from the Laplacian eigenvalues an estimation on the vulnerability of large networks that are intractable for exact methods. Through experiments on both synthetic and real-world networks, we demonstrate the efficiency of the proposed methods.

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

[2]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

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

[4]  Mario Ventresca,et al.  A derandomized approximation algorithm for the critical node detection problem , 2014, Comput. Oper. Res..

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

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

[7]  Jack Dongarra,et al.  ScaLAPACK user's guide , 1997 .

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

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

[10]  B. Mohar,et al.  Eigenvalues in Combinatorial Optimization , 1993 .

[11]  Jeroen H. G. C. Rutten,et al.  Disconnecting graphs by removing vertices: a polyhedral approach , 2007 .

[12]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[13]  Daniel Vanderpooten,et al.  Critical edges/nodes for the minimum spanning tree problem: complexity and approximation , 2013, J. Comb. Optim..

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

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

[16]  Marco Di Summa,et al.  Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth , 2013, Discret. Appl. Math..

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

[18]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[19]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

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

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

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

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

[24]  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.

[25]  Arnold L. Rosenberg,et al.  Bounding damage from link destruction, with application to the internet , 2007, SIGMETRICS '07.

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

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

[28]  Padhraic Smyth,et al.  A Spectral Clustering Approach To Finding Communities in Graph , 2005, SDM.

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

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

[31]  Brian Neil Levine,et al.  Bounds on service quality for networks subject to augmentation and attack , 2010 .

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

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

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

[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]  Peng Xiao,et al.  Finding the anti-block vital edge of a shortest path between two nodes , 2007, J. Comb. Optim..

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

[38]  Daniel Vanderpooten,et al.  Complexity of determining the most vital elements for the p-median and p-center location problems , 2013, J. Comb. Optim..

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

[40]  My T. Thai,et al.  Adaptive algorithms for detecting critical links and nodes in dynamic networks , 2012, MILCOM 2012 - 2012 IEEE Military Communications Conference.