Open AccessAn Improved Dynamic Probabilistic Packet Marking Algorithm
Author(s) -
Qiao Yan,
Xiaoming He,
Tu-wen NING
Publication year - 2011
Publication title -
international journal of wireless and microwave technologies
Language(s) - English
Resource type - Journals
eISSN - 2076-9539
pISSN - 2076-1449
DOI - 10.5815/ijwmt.2011.05.04
Subject(s) - probabilistic logic , computer science , network packet , algorithm , computer network , artificial intelligence
An improved dynamic probabilistic packet marking algorithm named IDPPM is presented, which not only can reduce the marking overhead of routers near the attackers, but also can locate attack source rapidly and accurately. The challenge of weakest node and weakest link is solved with the price of a little more numbers of packets to reconstruct the attack path. Theoretical analysis and NS2 simulation demonstrate the effectiveness of the algorithm
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom