Minimizing Expected Attacking Cost in Networks

Anis Gharbi (1) , Azaiez Mohamed Naceur (2) , Mohamed Kharbeche (3, 4)

1 PFARCAMT, Department of Industrial Engineering, College of Engineering
2 PFARCAMT, Department of Industrial Engine College of Engineering,
3 ROI - Unité Recherche Opérationnelle pour l'Industrie
4 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]

A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attacker cannot launch an attack if its cost is beyond his available budget or its probability of success falls below a threshold level. The proposed branch-andbound algorithm includes, among other features, a dynamic programming-based lower bound as well as a preprocessing algorithm which aims at identifying unattackable links and removing irrelevant ones. Extensive use of the min-cut algorithm is made to derive valid upper bounds and to perform feasibility tests. Preliminary numerical implementation shows potential to provide exact solutions for medium-sized networks within reasonable time.

Mots clés: Network attack; Branch-and-Bound; Minimum Cut

Domaines: Recherche opérationnelle [math.OC]

Anis Gharbi, Azaiez Mohamed Naceur, Mohamed Kharbeche. Minimizing Expected Attacking Cost in Networks. International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.947-954, ⟨10.1016/j.endm.2010.05.120⟩. ⟨hal-00504367⟩