Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment

Studying on networked systems, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received significant attention recently. In this work, we propose a metric to measure network resilience on guaranteeing the pre-defined performance constraint. This metric is investigated under an optimization problem, namely \textbf{Length-bounded Paths Interdiction in Continuous Domain} (cLPI), which aims to identify a minimum set of nodes whose changes cause routing paths between nodes become undesirable for the network service. We show the problem is NP-hard and propose a framework by designing two oracles, \textit{Threshold Blocking} (TB) and \textit{Critical Path Listing} (CPL), which communicate back and forth to construct a feasible solution to cLPI with theoretical bicriteria approximation guarantees. Based on this framework, we propose two solutions for each oracle. Each combination of one solution to \tb and one solution to \cpl gives us a solution to cLPI. The bicriteria guarantee of our algorithms allows us to control the solutions's trade-off between the returned size and the performance accuracy. New insights into the advantages of each solution are further discussed via experimental analysis.

[1]  Fernando M. V. Ramos,et al.  Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.

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

[3]  My T. Thai,et al.  Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach , 2019, SIGMETRICS.

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

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

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

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

[8]  My T. Thai,et al.  Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees , 2019, PERV.

[9]  Andrii Shalaginov,et al.  Cyber Security Risk Assessment of a DDoS Attack , 2016, ISC.

[10]  Elaine Wong,et al.  A Feasibility Study of IEEE 802.11 HCCA for Low-Latency Applications , 2019, IEEE Transactions on Communications.

[11]  James M. Calvin,et al.  An Adaptive Univariate Global Optimization Algorithm and Its Convergence Rate for Twice Continuously Differentiable Functions , 2012, J. Optim. Theory Appl..

[12]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[13]  Yonggang Wen,et al.  “ A Survey of Software Defined Networking , 2020 .

[14]  Mahmood Fathy,et al.  Software-based fault-tolerant routing algorithm in multidimensional networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[15]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[16]  Djamel Aaid,et al.  New technique for solving univariate global optimization , 2017 .

[17]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[18]  Éva Tardos,et al.  Min-Max Multiway Cut , 2004, APPROX-RANDOM.

[19]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

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

[21]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[22]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[23]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[24]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

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

[26]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..