Abstract
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.
- 2018. Blockchain: how a 51 percent attack works (double spend attack). https://medium.com/coinmonks/ what-is-a-51-attack-or-double-spend-attack-aa108db63474. (2018). Accessed: 2019-01-03.Google Scholar
- 2018. Boole's inequality. https://en.wikipedia.org/wiki/Boole%27s_inequality. (2018). Accessed: 2018--10--26.Google Scholar
- 2018. Cauchy-Schwarz inequality. https://en.wikipedia.org/wiki/Cauchy%E2%80%93Schwarz_inequality. (2018). Accessed: 2018--10--26.Google Scholar
- 2018. Congestion Attack on CV-based Traffic Signal Control. (2018). https://sites.google.com/view/cav-sec/ congestion-attack Accessed: 2018--10--26.Google Scholar
- 2018. Connected Vehicle Pilot Deployment Program. https://www.its.dot.gov/pilots/. (2018). Accessed: 2018--10--26.Google Scholar
- 2018. CV Pilot Deployment Program. https://www.its.dot.gov/pilots/cv_pilot_apps.htm. (2018). Accessed: 2018--10--26.Google Scholar
- 2018. LB-MULTICUT source code. (2018). Retrieved October 4, 2018 from https://gitlab.com/kuhnle/multi-pcut Accessed: 2018--10--26.Google Scholar
- 2018. Markov's inequality. https://en.wikipedia.org/wiki/Markov%27s_inequality. (2018). Accessed: 2018--10--26.Google Scholar
- 2019. Source code. https://github.com/lannn2410/qosd. (2019). Accessed: 2019-01--10.Google Scholar
- Amit Agarwal, Noga Alon, and Moses S Charikar. 2007. Improved approximation for directed cut problems. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM, 671--680. Google Scholar
Digital Library
- Maria Apostolaki, Aviv Zohar, and Laurent Vanbever. 2017. Hijacking bitcoin: Routing attacks on cryptocurrencies. In Security and Privacy (SP), 2017 IEEE Symposium on. IEEE, 375--392.Google Scholar
Cross Ref
- Andrew An Bian, Joachim M Buhmann, Andreas Krause, and Sebastian Tschiatschek. 2017. Guarantees for greedy maximization of non-submodular functions with applications. arXiv preprint arXiv:1703.02100 (2017).Google Scholar
- Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D Sivakumar. 2006. On the hardness of approximating multicut and sparsest-cut. computational complexity 15, 2 (2006), 94--114. Google Scholar
Digital Library
- Stephen Checkoway, Damon McCoy, Brian Kantor, Danny Anderson, Hovav Shacham, Stefan Savage, Karl Koscher, Alexei Czeskis, Franziska Roesner, Tadayoshi Kohno, and others. 2011. Comprehensive experimental analyses of automotive attack surfaces.. In USENIX Security Symposium. San Francisco, 77--92. Google Scholar
Digital Library
- Qi Alfred Chen, Yucheng Yin, Yiheng Feng, Z Morley Mao, and Henry X Liu. 2018. Exposing Congestion Attack on Emerging Connected Vehicle based Traffic Signal Control. In Network and Distributed Systems Security (NDSS) Symposium 2018.Google Scholar
Cross Ref
- IBM ILOG CPLEX. 2009. V12. 1: User's Manual for CPLEX. International Business Machines Corporation 46, 53 (2009), 157.Google Scholar
- Abhimanyu Das and David Kempe. 2011. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975 (2011). Google Scholar
Digital Library
- Richard Dennis, Gareth Owenson, and Benjamin Aziz. 2016. A temporal blockchain: a formal analysis. In Collaboration Technologies and Systems (CTS), 2016 International Conference on. IEEE, 430--437.Google Scholar
Cross Ref
- Thang N Dinh and My T Thai. 2015. Assessing attack vulnerability in networks with uncertainty. In Computer Communications (INFOCOM), 2015 IEEE Conference on. IEEE, 2380--2388.Google Scholar
Cross Ref
- Thang N Dinh and My T Thai. 2015. Network under joint node and link attacks: Vulnerability assessment methods and analysis. IEEE/ACM Transactions on Networking 23, 3 (2015), 1001--1011. Google Scholar
Digital Library
- Thang N Dinh, My T Thai, and Hien T Nguyen. 2014. Bound and exact methods for assessing link vulnerability in complex networks. Journal of Combinatorial Optimization 28, 1 (2014), 3--24. Google Scholar
Digital Library
- Thang N Dinh, Ying Xuan, My T Thai, EK Park, and Taieb Znati. 2010. On Approximation of New Optimization Methods for Assessing Network Vulnerability.. In INFOCOM, Vol. 2010. 1--9. Google Scholar
Digital Library
- Paul Erdos and Alfréd Rényi. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 1 (1960), 17--60.Google Scholar
- Naveen Garg, Vijay V Vazirani, and Mihalis Yannakakis. 1996. Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25, 2 (1996), 235--251. Google Scholar
Digital Library
- Tony H Grubesic, Timothy C Matisziw, Alan T Murray, and Diane Snediker. 2008. Comparative approaches for assessing network vulnerability. International Regional Science Review 31, 1 (2008), 88--112.Google Scholar
Cross Ref
- Anupam Gupta. 2003. Improved results for directed multicut. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Citeseer, 454--455. Google Scholar
Digital Library
- Wassily Hoeffding. 1963. Probability inequalities for sums of bounded random variables. Journal of the American statistical association 58, 301 (1963), 13--30.Google Scholar
Cross Ref
- Karl Koscher, Alexei Czeskis, Franziska Roesner, Shwetak Patel, Tadayoshi Kohno, Stephen Checkoway, Damon McCoy, Brian Kantor, Danny Anderson, Hovav Shacham, and others. 2010. Experimental security analysis of a modern automobile. In Security and Privacy (SP), 2010 IEEE Symposium on. IEEE, 447--462. Google Scholar
Digital Library
- Alan Kuhnle, Victoria G Crawford, and My T Thai. 2018. Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. Proceedings of the ACM on Measurement and Analysis of Computing Systems 2, 1 (2018), 4. Google Scholar
Digital Library
- Alan Kuhnle, J David Smith, Victoria G Crawford, and My T Thai. 2018. Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. arXiv preprint arXiv:1805.06990 (2018).Google Scholar
- Euiwoong Lee. 2016. Improved hardness for cut, interdiction, and firefighter problems. arXiv preprint arXiv:1607.05133 (2016).Google Scholar
- Benny Lehmann, Daniel Lehmann, and Noam Nisan. 2006. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55, 2 (2006), 270--296.Google Scholar
Cross Ref
- Jure Leskovec and Andrej Krevl. 2018. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford. edu/data. (2018). Accessed: 2018--10--26.Google Scholar
- Sahar Mazloom, Mohammad Rezaeirad, Aaron Hunter, and Damon McCoy. 2016. A Security Analysis of an In-Vehicle Infotainment and App Platform.. In WOOT. Google Scholar
Digital Library
- Subhankar Mishra, Xiang Li, My T Thai, and Jungtaek Seo. 2014. Cascading Critical Nodes Detection with Load Redistribution in Complex Systems. In International Conference on Combinatorial Optimization and Applications. Springer, 379--394.Google Scholar
- Dung T Nguyen, Yilin Shen, My T Thai, and others. 2013. Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment. IEEE Trans. Smart Grid 4, 1 (2013), 151--159.Google Scholar
Cross Ref
- Tianyi Pan, Alan Kuhnle, Xiang Li, and My Thai. 2018. Vulnerability of Interdependent Networks with Heterogeneous Cascade Models and Timescales. In 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS). IEEE, 290--299.Google Scholar
- Carlos Pinzón and Camilo Rocha. 2016. Double-spend attack models with time advantange for bitcoin. Electronic Notes in Theoretical Computer Science 329 (2016), 79--103. Google Scholar
Digital Library
- Ben Roberts and Dirk P Kroese. 2007. Estimating the Number of st Paths in a Graph. J. Graph Algorithms Appl. 11, 1 (2007), 195--214.Google Scholar
Cross Ref
- Arunabha Sen, Sudheendra Murthy, and Sujogya Banerjee. 2009. Region-based connectivity-a new paradigm for design of fault-tolerant networks. In High Performance Switching and Routing, 2009. HPSR 2009. International Conference on. IEEE, 1--7. Google Scholar
Digital Library
- Yilin Shen, Thang N Dinh, and My T Thai. 2012. Adaptive algorithms for detecting critical links and nodes in dynamic networks.. In MILCOM. Citeseer, 1--6.Google Scholar
- Yilin Shen, Nam P Nguyen, Ying Xuan, and My T Thai. 2013. On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Transactions on Networking 21, 3 (2013), 963--973. Google Scholar
Digital Library
- Vijay V Vazirani. 2013. Approximation algorithms. Springer Science & Business Media. Google Scholar
Digital Library
Index Terms
Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
Recommendations
Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
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 Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
SIGMETRICS '19: Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer SystemsThis 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 Resilience
The resilience of a network is a measure of its reliability; it is the expected number of node pairs which can communicate. The resilience of an n-vertex series-parallel network can be computed in $O(n^2 )$ time. The algorithm employs the recursive ...






Comments