Automating the configuration of distributed firewalls by refining high-level security requirements is a well-established approach to improve correctness and manageability in modern computer networks. However, existing solutions formulate this task as a single monolithic constraint-solving problem, whose scalability suffers as network size and policy complexity increase. To overcome this limitation, this paper proposes a traffic-aware decomposition approach for the automated, parallel configuration of distributed firewalls. The method decomposes the global refinement problem into cluster-scoped subproblems using a flow-weighted network representation and solves them concurrently before merging the results into a single deployable configuration. The approach is implemented on top of a constraint-based framework and evaluated on representative topologies. The results show substantial runtime reductions, with gains increasing with problem size and reaching up to ~98% on larger instances, while maintaining satisfactory optimization quality. Moreover, the approach enables the resolution of firewall configuration problems beyond the limits of monolithic formulations.

Parallelizing Automated Firewall Configuration via Traffic-Aware Decomposition / Pizzato, F., Bringhenti, D., Valenza, F.. - In: IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. - ISSN 1932-4537. - ELETTRONICO. - (In corso di stampa). [10.1109/TNSM.2026.3747990]

Parallelizing Automated Firewall Configuration via Traffic-Aware Decomposition

Francesco Pizzato;Daniele Bringhenti;Fulvio Valenza
In corso di stampa

Abstract

Automating the configuration of distributed firewalls by refining high-level security requirements is a well-established approach to improve correctness and manageability in modern computer networks. However, existing solutions formulate this task as a single monolithic constraint-solving problem, whose scalability suffers as network size and policy complexity increase. To overcome this limitation, this paper proposes a traffic-aware decomposition approach for the automated, parallel configuration of distributed firewalls. The method decomposes the global refinement problem into cluster-scoped subproblems using a flow-weighted network representation and solves them concurrently before merging the results into a single deployable configuration. The approach is implemented on top of a constraint-based framework and evaluated on representative topologies. The results show substantial runtime reductions, with gains increasing with problem size and reaching up to ~98% on larger instances, while maintaining satisfactory optimization quality. Moreover, the approach enables the resolution of firewall configuration problems beyond the limits of monolithic formulations.
File in questo prodotto:
File Dimensione Formato  
TNSM_Parallel_AcceptedManuscript.pdf

accesso aperto

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Pubblico - Tutti i diritti riservati
Dimensione 7.49 MB
Formato Adobe PDF
7.49 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/3016987