Visible to the public Exact and approximation algorithms for sensor placement against DDoS attacks

TitleExact and approximation algorithms for sensor placement against DDoS attacks
Publication TypeConference Paper
Year of Publication2020
AuthorsJunosza-Szaniawski, K., Nogalski, D., Wójcik, A.
Conference Name2020 15th Conference on Computer Science and Information Systems (FedCSIS)
Date Publishedsep
KeywordsDDoS, heuristics, minimum multicut, network safety optimization, predictability, pubcrawl, Resiliency, Scalability, Security Heuristics, sensor placement
AbstractIn DDoS attack (Distributed Denial of Service), an attacker gains control of many network users by a virus. Then the controlled users send many requests to a victim, leading to lack of its resources. DDoS attacks are hard to defend because of distributed nature, large scale and various attack techniques. One of possible ways of defense is to place sensors in the network that can detect and stop an unwanted request. However, such sensors are expensive so there is a natural question about a minimum number of sensors and their optimal placement to get the required level of safety. We present two mixed integer models for optimal sensor placement against DDoS attacks. Both models lead to a trade-off between the number of deployed sensors and the volume of uncontrolled flow. Since above placement problems are NP-hard, two efficient heuristics are designed, implemented and compared experimentally with exact linear programming solvers.
DOI10.15439/2020F106
Citation Keyjunosza-szaniawski_exact_2020