Min–max optimization of node‐targeted ...
Document type :
Compte-rendu et recension critique d'ouvrage
DOI :
Title :
Min–max optimization of node‐targeted attacks in service networks
Author(s) :
Fortz, Bernard [Auteur]
Département d'Informatique [Bruxelles] [ULB]
Integrated Optimization with Complex Structure [INOCS]
Mycek, Mariusz [Auteur]
Pióro, Michał [Auteur]
Tomaszewski, Artur [Auteur]
Département d'Informatique [Bruxelles] [ULB]
Integrated Optimization with Complex Structure [INOCS]
Mycek, Mariusz [Auteur]
Pióro, Michał [Auteur]
Tomaszewski, Artur [Auteur]
Journal title :
Networks
Publisher :
Wiley
Publication date :
2023-10-10
ISSN :
0028-3045
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
This paper considers resilience of service networks that are composed of service and control nodes to node‐targeted attacks. Two complementary problems of selecting attacked nodes and placing control nodes reflect the ...
Show more >This paper considers resilience of service networks that are composed of service and control nodes to node‐targeted attacks. Two complementary problems of selecting attacked nodes and placing control nodes reflect the interaction between the network operator and the network attacker. This interaction can be analyzed within the framework of game theory. Considering the limited performance of the previously introduced iterative solution algorithms based on non‐compact problem models, new compact integer programming formulations of the node attack optimization problem are proposed, which are based on the notion of pseudo‐components and on a bilevel model. The efficiency of the new formulations is illustrated by the numerical study that uses two reference networks (medium‐size and large‐size), and a wide range of the sizes of attacks and controllers placements.Show less >
Show more >This paper considers resilience of service networks that are composed of service and control nodes to node‐targeted attacks. Two complementary problems of selecting attacked nodes and placing control nodes reflect the interaction between the network operator and the network attacker. This interaction can be analyzed within the framework of game theory. Considering the limited performance of the previously introduced iterative solution algorithms based on non‐compact problem models, new compact integer programming formulations of the node attack optimization problem are proposed, which are based on the notion of pseudo‐components and on a bilevel model. The efficiency of the new formulations is illustrated by the numerical study that uses two reference networks (medium‐size and large‐size), and a wide range of the sizes of attacks and controllers placements.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- document
- Open access
- Access the document
- main.pdf
- Open access
- Access the document