Network Resilience Assessment via QoS Degradation Metrics

This paper focuses on network resilience to perturbation of edge weight. Other than connectivity, many network applications nowadays rely upon some measure of network distance between a pair of connected nodes. In these systems, a metric related to network functionality is associated to each edge. A pair of nodes only being functional if the weighted, shortest-path distance between the pair is below a given threshold T. Consequently, a natural question is on which degree the change of edge weights can damage the network functionality? With this motivation, we study a new problem, Quality of Service Degradation : given a set of pairs, find a minimum budget to increase the edge weights which ensures the distance between each pair exceeds T . We introduce four algorithms with theoretical performance guarantees for this problem. Each of them has its own strength in trade-off between effectiveness and running time, which are illustrated both in theory and comprehensive experimental evaluation.

[1]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[2]  Xiang Li,et al.  Cascading Critical Nodes Detection with Load Redistribution in Complex Systems , 2014, COCOA.

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

[4]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[5]  Andreas Krause,et al.  Guarantees for Greedy Maximization of Non-submodular Functions with Applications , 2017, ICML.

[6]  My T. Thai,et al.  Bound and exact methods for assessing link vulnerability in complex networks , 2014, J. Comb. Optim..

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

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

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

[10]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[11]  My T. Thai,et al.  Assessing attack vulnerability in networks with uncertainty , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[12]  Laurent Vanbever,et al.  Hijacking Bitcoin: Routing Attacks on Cryptocurrencies , 2016, 2017 IEEE Symposium on Security and Privacy (SP).

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

[14]  Camilo Rocha,et al.  Double-spend Attack Models with Time Advantange for Bitcoin , 2016, CLEI Selected Papers.

[15]  My T. Thai,et al.  Network Resilience and the Length-Bounded Multicut Problem , 2018, Proc. ACM Meas. Anal. Comput. Syst..

[16]  Hovav Shacham,et al.  Comprehensive Experimental Analyses of Automotive Attack Surfaces , 2011, USENIX Security Symposium.

[17]  Xiang Li,et al.  Vulnerability of Interdependent Networks with Heterogeneous Cascade Models and Timescales , 2018, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS).

[18]  Abhimanyu Das,et al.  Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.

[19]  Aaron Hunter,et al.  A Security Analysis of an In-Vehicle Infotainment and App Platform , 2016, WOOT.

[20]  Yuval Rabani,et al.  On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.

[21]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[22]  Matemática.  Markov's Inequality , 2010 .

[23]  Matti Valovirta,et al.  Experimental Security Analysis of a Modern Automobile , 2011 .

[24]  Benjamin Aziz,et al.  A Temporal Blockchain: A Formal Analysis , 2016, 2016 International Conference on Collaboration Technologies and Systems (CTS).

[25]  Yiheng Feng,et al.  Exposing Congestion Attack on Emerging Connected Vehicle based Traffic Signal Control , 2018, NDSS.

[26]  Kate Hartman.  Connected vehicle pilot deployment program. , 2014 .

[27]  Anupam Gupta.  Improved results for directed multicut , 2003, SODA '03.

[28]  My T. Thai,et al.  Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice , 2018, ICML.

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

[30]  Noga Alon,et al.  Improved approximation for directed cut problems , 2007, STOC '07.

[31]  My T. Thai,et al.  Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment , 2013, IEEE Transactions on Smart Grid.

[32]  Dirk P. Kroese,et al.  Estimating the Number of s-t Paths in a Graph , 2007, J. Graph Algorithms Appl..

[33]  Euiwoong Lee.  Improved Hardness for Cut, Interdiction, and Firefighter Problems , 2017, ICALP.

[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]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .