透過您的圖書館登入
IP:3.144.212.145
  • 期刊

Markov Chain Modelling of the Probabilistic Packet Marking Algorithm

並列摘要


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

被引用紀錄


Huang, C. C. (2008). 週期式固定機率封包標記追蹤技術 [master's thesis, Tatung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917243637

延伸閱讀