Optimal k cut-sets in attack/defense strategies on networks

The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2020-01, Vol.8, p.1-1
Main Authors: Mrad, Mehdi, Suryahatmaja, Umar S., Yaghlane, Asma Ben, Azaiez, M. Naceur
Format: Article
Language:English
Subjects:
Algorithms
Cut-set
defense
Games
Government
interdiction networks
multiple-attacks
Networks
path-set
Reliability
Roads
Target recognition
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks the next link to target after identifying the outcome of the attack on the previous one. The attack may continue to reach up to k cut-sets. The problem is to identify which cut-sets to target (referred to as the k-critical cut-sets of the network) that maximize the probability of a successful attack. We distinguish both cases of disjoint and non-disjoint cut-sets. We develop an algorithm for each case with illustrations. We explore the large scale of networks and offer guidelines on the corresponding defensive strategies.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.3009625