|
Title:
|
MODELLING AND PERFORMANCE ANALYSIS OF PROBABILISTIC PACKET MARKING SCHEMES FOR IPTRACEBACK |
|
Author(s):
|
Shigeo Shioda , Hui Jing Wang |
|
ISBN:
|
972-8924-19-4 |
|
Editors:
|
Pedro Isaías |
|
Year:
|
2006 |
|
Edition:
|
V II, 2 |
|
Keywords:
|
denial of service attack, IP traceback, probabilistic packet marking, coupon collector problem |
|
Type:
|
Short Paper |
|
First Page:
|
339 |
|
Last Page:
|
344 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Probabilistic packet marking (PPM) is an IP traceback technique that lets routers probabilistically mark packets with partial information of an attack path during packet forwarding. In this paper, we theoretically evaluate the efficiency of typical PPM schemes, including fragment marking, hash marking, multiple hash, and hash fragment, based on a simple analytical model. In particular, for each scheme, we derive an explicit representation of the average number of packets that the victim should receive until the entire attack paths can be reconstructed. We also derive the explicit representations for false positive and false negative ratios of each PPM scheme concerning the attack path detection. We conducted several numerical experiments to clarify strong and weak points of existing PPM schemes. |
|
|
|
|
|
|
