All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/20:10245215

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

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

  • Continuities

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

Others

  • Publication year

    2020

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Computer Networks

  • ISSN

    1389-1286

  • e-ISSN

  • Volume of the periodical

    182

  • Issue of the periodical within the volume

    2020

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    14

  • Pages from-to

  • UT code for WoS article

  • EID of the result in the Scopus database

    2-s2.0-85089223636