Network Resilience Assessment via QoS Degradation Metrics-Reference-Cited by-同舟云学术

Network Resilience Assessment via QoS Degradation Metrics

Published:2019-03-26 Issue:1 Volume:3 Page:1-32
ISSN:2476-1249
Container-title:Proceedings of the ACM on Measurement and Analysis of Computing Systems
language:en
Short-container-title:Proc. ACM Meas. Anal. Comput. Syst.

Author:

Nguyen Lan N.¹,Thai My T.¹

Affiliation:

1. University of Florida, Gainesville, FL, USA

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.

Funder

National Science Foundation

Defense Threat Reduction Agency

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Computer Science (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/3322205.3311072

Reference43 articles.

1. 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. 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.

2. 2018. Boole's inequality. https://en.wikipedia.org/wiki/Boole%27s_inequality. (2018). Accessed: 2018--10--26. 2018. Boole's inequality. https://en.wikipedia.org/wiki/Boole%27s_inequality. (2018). Accessed: 2018--10--26.

3. 2018. Cauchy-Schwarz inequality. https://en.wikipedia.org/wiki/Cauchy%E2%80%93Schwarz_inequality. (2018). Accessed: 2018--10--26. 2018. Cauchy-Schwarz inequality. https://en.wikipedia.org/wiki/Cauchy%E2%80%93Schwarz_inequality. (2018). Accessed: 2018--10--26.

4. 2018. Congestion Attack on CV-based Traffic Signal Control. (2018). https://sites.google.com/view/cav-sec/ congestion-attack Accessed: 2018--10--26. 2018. Congestion Attack on CV-based Traffic Signal Control. (2018). https://sites.google.com/view/cav-sec/ congestion-attack Accessed: 2018--10--26.

5. 2018. Connected Vehicle Pilot Deployment Program. https://www.its.dot.gov/pilots/. (2018). Accessed: 2018--10--26. 2018. Connected Vehicle Pilot Deployment Program. https://www.its.dot.gov/pilots/. (2018). Accessed: 2018--10--26.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Continuous Length-Bounded Paths Interdiction;Lecture Notes in Computer Science;2024

2. Network Resilience Assessment via QoS Degradation Metrics;ACM SIGMETRICS Performance Evaluation Review;2019-12-17

3. Network Resilience Assessment via QoS Degradation Metrics;Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems;2019-06-20