On packet marking and Markov modeling for IP Traceback: A deep probabilistic and stochastic analysis

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10245215" target="_blank" >RIV/61989100:27240/20:10245215 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/20:10245215

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/pii/S1389128620311439" target="_blank" >https://www.sciencedirect.com/science/article/pii/S1389128620311439</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.comnet.2020.107464" target="_blank" >10.1016/j.comnet.2020.107464</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On packet marking and Markov modeling for IP Traceback: A deep probabilistic and stochastic analysis

Popis výsledku v původním jazyce

From many years, the methods to defend against Denial of Service attacks have been very attractive from different point of views, although network security is a large and very complex topic. Different techniques have been proposed and so-called packet marking and IP tracing procedures have especially demonstrated a good capacity to face different malicious attacks. While host-based DoS attacks are more easily traced and managed, network-based DoS attacks are a more challenging threat. In this paper, we discuss a powerful aspect of the IP traceback method, which allows a router to mark and add information to attack packets on the basis of a fixed probability value. We propose a potential method for modeling the classic probabilistic packet marking algorithm as Markov chains, allowing a closed form to be obtained for evaluating the correct number of received marked packets in order to build a meaningful attack graph and analyze how marking routers must behave to minimize the overall overhead.

Název v anglickém jazyce

On packet marking and Markov modeling for IP Traceback: A deep probabilistic and stochastic analysis

Popis výsledku anglicky

From many years, the methods to defend against Denial of Service attacks have been very attractive from different point of views, although network security is a large and very complex topic. Different techniques have been proposed and so-called packet marking and IP tracing procedures have especially demonstrated a good capacity to face different malicious attacks. While host-based DoS attacks are more easily traced and managed, network-based DoS attacks are a more challenging threat. In this paper, we discuss a powerful aspect of the IP traceback method, which allows a router to mark and add information to attack packets on the basis of a fixed probability value. We propose a potential method for modeling the classic probabilistic packet marking algorithm as Markov chains, allowing a closed form to be obtained for evaluating the correct number of received marked packets in order to build a meaningful attack graph and analyze how marking routers must behave to minimize the overall overhead.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

20203 - Telecommunications

Projekt

<a href="/cs/project/LM2018140" target="_blank" >LM2018140: e-Infrastruktura CZ</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computer Networks

ISSN

1389-1286

e-ISSN

—

Svazek periodika

182

Číslo periodika v rámci svazku

2020

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85089223636