A packet filter placement problem with application to defense against spoofed denial of service attacks
From MaRDI portal
Publication:853001
DOI10.1016/j.ejor.2005.09.031zbMath1102.90044OpenAlexW2121383185MaRDI QIDQ853001
Benjamin Armbruster, J. Cole Smith, Kihong Park
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.031
combinatorial optimizationvertex coverinternetroute-based packet filteringspoofed denial of service attack
Related Items (2)
Exact and approximation algorithms for sensor placement against DDoS attacks ⋮ On co-design of filter and fault estimator against randomly occurring nonlinearities and randomly occurring deception attacks
Cites Work
- Unnamed Item
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations
- On Representatives of Subsets
- Perfect, ideal and balanced matrices
This page was built for publication: A packet filter placement problem with application to defense against spoofed denial of service attacks