Journal of the ACM (JACM)
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Between Min Cut and Graph Bisection
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Partitioning Avoidance in Mobile Ad Hoc Networks Using Network Survivability Concepts
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory
On pairwise connectivity of wireless multihop networks
International Journal of Security and Networks
Detecting critical nodes in sparse graphs
Computers and Operations Research
Region-based connectivity: a new paradigm for design of fault-tolerant networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
DRAGON: a framework for service provisioning in heterogeneous grid networks
IEEE Communications Magazine
Evaluation of topological vulnerability of the internet under regional failures
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
A decomposition approach for solving critical clique detection problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Sensitivity analysis of the power grid vulnerability to large-scale cascading failures
ACM SIGMETRICS Performance Evaluation Review
Assessing network vulnerability in a community structure point of view
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
On the discovery of critical links and nodes for assessing network vulnerability
IEEE/ACM Transactions on Networking (TON)
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vital for planning and risk management. Existing approaches to vulnerability assessments of large-scale systems mainly focus on investigating inhomogeneous properties of the underlying graph elements. These measures and the associated heuristic solutions are limited in evaluating the vulnerability of large-scale network topologies. Furthermore, these approaches often fail to provide performance guarantees of the proposed solutions. In this paper, we propose a vulnerability measure, pairwise connectivity, and use it to formulate network vulnerability assessment as a graph-theoretical optimization problem, referred to as β-disruptor. The objective is to identify the minimum set of critical network elements, namely nodes and edges, whose removal results in a specific degradation of the network global pairwise connectivity. We prove the NP-completeness and inapproximability of this problem and propose an O(log n log log n) pseudo-approximation algorithm to computing the set of critical nodes and an O(log1.5n) pseudo-approximation algorithm for computing the set of critical edges. The results of an extensive simulation-based experiment show the feasibility of our proposed vulnerability assessment framework and the efficiency of the proposed approximation algorithms in comparison to other approaches.