A theoretical approach to parameter value selection of probabilistic packet marking for IP traceback

Authors:
Shigeo Shioda
Affiliations:
Chiba University, Inage, Chiba, Japan
Venue:
AINTEC '09 Asian Internet Engineering Conference
Year:
2009

Citing 8
Cited 0

Network support for IP traceback

IEEE/ACM Transactions on Networking (TON)
An algebraic approach to IP traceback

ACM Transactions on Information and System Security (TISSEC)
Efficient packet marking for large-scale IP traceback

Proceedings of the 9th ACM conference on Computer and communications security
Tracing Anonymous Packets to Their Approximate Source

LISA '00 Proceedings of the 14th USENIX conference on System administration
Trade-offs in probabilistic packet marking for IP traceback

Journal of the ACM (JACM)
Towards asymptotic optimality in probabilistic packet marking

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Some upper and lower bounds on the coupon collector problem

Journal of Computational and Applied Mathematics
Inferring internet denial-of-service activity

SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the performance of the fragment-marking-based probabilistic packet marking (PPM) for the IP traceback. In the fragment-marking-based PPM, each router splits its IP-address or its hash value into multiple fragments and, in the case of marking, it randomly chooses one of fragments to write into the Identification field of a packet to forward. In the fragment marking, the Identification field is partitioned into three small fields; a bid-bit field (fragment-ID field) storing the index of fragments, a bd-bit field (distance field) storing the hop distance between the victim to the marking router, and a (16 -- bid -- bd)-bit field (fragment field) storing a fragment. In this paper, we theoretically investigate the dependence of the performance of the fragment-marking-based PPM on parameters including bid and bd. In particular, we derive explicit representations of the false positive and negative ratios of the fragment marking, which are expressed by bd, bid, and some other parameters. Based on the derived representations, we study how to select parameter values to have better performance of the fragment marking.