By Topic

Fast Two Phrases PPM for IP Traceback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qiang Li ; JiLin University, China ; Qinyuan Feng ; Liang Hu ; Jiubin Ju

In probabilistic packet marking(PPM) for IP tracebacking, the number of packets that are needed to reconstruct the attacking paths depends on the precision of the attacking paths. In this paper, a Fast Two Phrases(FTP) PPM for IP tracebacking is proposed, which depends on the division of Autonomous System(AS) and two algorithms are used to reconstruct the attacking paths. It can reconstruct the exactly attacking paths between AS when it has received tens of packets, and reconstruct the attacking paths in AS after receiving more packets. This method can reduce the number of packets that are needed to reconstruct the attacking paths to the lowest while reducing the complexity of packet marking and reconstructing.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on

Date of Conference:

05-08 Dec. 2005