Markov chain modelling of the probabilistic packet marking algorithm
Publication in refereed journal


Full Text

Times Cited

Other information
AbstractIn this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimation of expected number of marked packets is not accurate. As a result, this may lead to an incomplete attack graph construction. To remedy this problem, we propose a Markov chain modelling of the PPM algorithm. By applying the fundamental matrix theory, one can result in an accurate estimation of the expected number of marked packets. Our simulation results show that the Markov chain modelling technique is effective in calculating the expected number of marked packets.
All Author(s) ListWong T.-Y., Lui J.C.-S., Wong M.-H.
Journal nameInternational Journal of Network Security
Year2007
Month12
Day1
Volume Number5
Issue Number1
PublisherNational Chung Hsing University
Place of PublicationTaiwan
Pages32 - 40
ISSN1816-353X
LanguagesEnglish-United Kingdom
KeywordsDenialof-service attack, IP traceback, Markov chain model, PPM algorithm

Last updated on 2020-05-09 at 23:03