Exact and heuristic algorithms for solving the generalized minimum filter placement problem

DOI10.1007/S10878-006-9631-2MaRDI QIDQ2369983zbMATH OpenOpenAlexFDO

Authors E. Chisonge Mofya, J. Cole Smith

Publication date 21 June 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10150/194097

zbMATH Keywords

heuristicsfacetsmixed-integer programmingdenial of service attackscomputer network security

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• A dynamic programming algorithm for the generalized minimum filter placement problem on tree structures
• A packet filter placement problem with application to defense against spoofed denial of service attacks
• Filtering undesirable flows in networks
• Solving the geometric firefighter routing problem via integer programming
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design

Cited in

(4)

• Exact and approximation algorithms for sensor placement against DDoS attacks
• A dynamic programming algorithm for the generalized minimum filter placement problem on tree structures
• A packet filter placement problem with application to defense against spoofed denial of service attacks
• Equilibrium strategies for multiple interdictors on a common network

This page was built for publication: Exact and heuristic algorithms for solving the generalized minimum filter placement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369983)