2026-08-16T03:40:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16646 2024-03-06T10:57:57Z ddc:004 open_access

DUELMIPs: Optimizing SDN Functionality and Security Curry, Timothy De Pace, Gabriel Fuller, Benjamin Michel, Laurent Sun, Yan (Lindsay) Network security mixed integer programming large neighborhood search Software defined networks (SDNs) define a programmable network fabric that can be reconfigured to respect global networks properties. Securing against adversaries who try to exploit the network is an objective that conflicts with providing functionality. This paper proposes a two-stage mixed-integer programming framework. The first stage automates routing decisions for the flows to be carried by the network while maximizing readability and ease of use for network engineers. The second stage is meant to quickly respond to security breaches to automatically decide on network counter-measures to block the detected adversary. Both stages are computationally challenging and the security stage leverages large neighborhood search to quickly deliver effective response strategies. The approach is evaluated on synthetic networks of various sizes and shown to be effective for both its functional and security objectives. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Timothy Curry and Gabriel De Pace and Benjamin Fuller and Laurent Michel and Yan (Lindsay) Sun 2022 Is Part Of LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CP.2022.17 urn:nbn:de:0030-drops-166468 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.17 eng https://creativecommons.org/licenses/by/4.0/legalcode