On the discovery of critical links and nodes for assessing network vulnerability

Authors:
Yilin Shen;Nam P. Nguyen;Ying Xuan;My T. Thai
Affiliations:
Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;eBay, Inc., San Jose, CA and Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 17
Cited 0

Introduction to operations research, 4th ed.

Introduction to operations research, 4th ed.
Unit disk graphs

Discrete Mathematics - Topics on domination
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tabu Search

Tabu Search
Conductance and congestion in power law graphs

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of optimization in power-law graphs

Theoretical Computer Science
On pairwise connectivity of wireless multihop networks

International Journal of Security and Networks
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Computers and Operations Research
Detecting critical nodes in sparse graphs

Computers and Operations Research
Universality considerations in VLSI circuits

IEEE Transactions on Computers
Complexity of the critical node problem over trees

Computers and Operations Research
Exploiting the robustness on power-law networks

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On new approaches of assessing network vulnerability: hardness and approximation

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The assessment of network vulnerability is of great importance in the presence of unexpected disruptive events or adversarial attacks targeting on critical network links and nodes. In this paper, we study Critical Link Disruptor (CLD) and Critical Node Disruptor (CND) optimization problems to identify critical links and nodes in a network whose removals maximally destroy the network's functions. We provide a comprehensive complexity analysis of CLD and CND on general graphs and show that they still remain NP-complete even on unit disk graphs and power-law graphs. Furthermore, the CND problem is shown NP-hard to be approximated within Ω (n-k/nε) on general graphs with n vertices and k critical nodes. Despite the intractability of these problems, we propose HILPR, a novel LP-based rounding algorithm, for efficiently solving CLD and CND problems in a timely manner. The effectiveness of our solutions is validated on various synthetic and real-world networks.