DocumentCode
3063201
Title
Fast Two Phrases PPM for IP Traceback
Author
Li, Qiang ; Feng, Qinyuan ; Hu, Liang ; Ju, Jiubin
Author_Institution
JiLin University, China
fYear
2005
fDate
05-08 Dec. 2005
Firstpage
386
Lastpage
389
Abstract
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.
Keywords
Computer crime; Computer science; Distributed computing; Filtration; Information security; Large-scale systems; Network topology; Protection;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Print_ISBN
0-7695-2405-2
Type
conf
DOI
10.1109/PDCAT.2005.139
Filename
1578940
Link To Document