Filtering undesirable flows in networks

DOI10.1007/978-3-319-71150-8_1zbMATH Open1470.68238OpenAlexW2769091902MaRDI QIDQ1699751FDOQ1699751

Authors: Gleb Polevoy, Stojan Trajanovski, Paola Grosso, Cees de Laat 

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_1

Recommendations

• Removing undesirable flows by edge deletion
• A packet filter placement problem with application to defense against spoofed denial of service attacks
• Trawling traffic under attack overcoming DDoS attacks by target-controlled traffic filtering
• Hardness and approximation for network flow interdiction
• Protection of flows under targeted attacks

zbMATH Keywords

approximationset coverlocal ratio algorithmMMSA

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (6)

• Internet packet filter management and rectangle geometry
• Filters. The Number of Channels That Can Clog in a Network
• A packet filter placement problem with application to defense against spoofed denial of service attacks
• Exact and heuristic algorithms for solving the generalized minimum filter placement problem
• Title not available (Why is that?)
• Removing undesirable flows by edge deletion

This page was built for publication: Filtering undesirable flows in networks

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