Please use this identifier to cite or link to this item:
|Title:||A general model of probabilistic packet marking for IP traceback|
Probabilistic packet marking (PPM)
Random packet marking (RPM)
|Source:||Lu, L., Chan, M.C., Chang, E.-C. (2008). A general model of probabilistic packet marking for IP traceback. Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08 : 179-188. ScholarBank@NUS Repository. https://doi.org/10.1145/1368310.1368337|
|Abstract:||In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated with a distribution on tags, which are short binary strings. To mark a packet, a marker follows its associated distribution in choosing the tag to write in the IP header. Since there are a large number of (for example, over 4,000) markers, what the victim receives are samples from a mixture of distributions. Essentially, traceback aims to identify individual distribution contributing to the mixture. Guided by this model, we propose Random Packet Marking (RPM), a scheme that uses a simple but effective approach. RPM does not require sophisticated structure/relationship among the tags, and employs a hop-by-hop reconstruction similar to AMS . Simulations show improved scalability and traceback accuracy over prior works. For example, in a large network with over 100K nodes, 4,650 markers induce 63% of false positives in terms of edges identification using the AMS marking scheme; while RPM lowers it to 2%. The effectiveness of RPM demonstrates that with prior knowledge of neighboring nodes, a simple and properly designed marking scheme suffices in identifying large number of markers with high accuracy. Copyright 2008 ACM.|
|Source Title:||Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 6, 2018
WEB OF SCIENCETM
checked on Jan 22, 2018
checked on Mar 11, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.