Lan N. Nguyen
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.
- Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D Sivakumar. 2006. On the hardness of approximating multicut and sparsest-cut. computational complexity, Vol. 15, 2 (2006), 94--114. 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, Vol. 2, 1 (2018), 4. Google ScholarDigital Library
- Euiwoong Lee. 2016. Improved hardness for cut, interdiction, and firefighter problems. arXiv preprint arXiv:1607.05133 (2016).Google Scholar
- Lan N Nguyen and My T Thai. 2019. Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 3, 1 (2019), 1.Google ScholarDigital 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
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 ...
Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach
We develop a graph-theoretic model for service-oriented networks and propose metrics that quantify the resilience of such networks under node and edge failures. These metrics are based on the topological structure of the network and the manner in which ...
Comments