An Improved Dynamic Probabilistic Packet Marking for IP Traceback

Full Text (PDF, 242KB), PP.47-53

Views: 0 Downloads: 0


Qiao Yan 1,* Xiaoming He 2 Tuwen Ning 2

1. Department of Computer and Software Shenzhen University, Shenzhen, China

2. Department of Information Engineering Shenzhen University, Shenzhen, China

* Corresponding author.


Received: 12 May 2010 / Revised: 1 Aug. 2010 / Accepted: 7 Oct. 2010 / Published: 8 Dec. 2010

Index Terms

Distributed Denial of Service (DDoS), IP traceback, Dynamic Probabilistic Packet Marking (DPPM), IPv6


An improved dynamic probabilistic packet marking algorithm named IDPPM is presented, which not only can locate and attack a source rapidly and accurately, but also can reduce the marking overhead of routers near the attackers, which is its greatest contribution given by our technique. In contrast to previous work, the challenge of weakest node and weakest link is solved with the price of a little more numbers of packets to reconstruct the attack path. Theoretical analysis and NS2 simulation results in IPv4 and IPv6 testify that the approach is feasible and efficient respectively.

Cite This Paper

Qiao Yan, Xiaoming He, Tuwen Ning, "An Improved Dynamic Probabilistic Packet Marking for IP Traceback", International Journal of Computer Network and Information Security(IJCNIS), vol.2, no.2, pp.47-53, 2010. DOI:10.5815/ijcnis.2010.02.07


[1] R. Morris, A weakness in the 4.2 BSD Unix TCP/IP Software, AT&T Bell Labs, Technical Report Computer Science 117, 1981. 

[2] H. Burch, and B. Cheswick, “Tracing Anonymous Packets to Their Approximate source,” the 14th USENIX conference on System administration, USENIX Association Press, pp. 319-328,Jul 2000

[3] S. Savage, D. Wetherall, and A. Karlin, “Network Support for IP Traceback,” Proc. IEEE/ACM Transactions on Networking, IEEE Press, pp. 226-237, June 2001

[4] D. Song,and A. Perrig, “Advanced and Authenticated Marking Schemes for IP Traceback,” Proc. the IEEE INFOCOM, IEEE Press, pp. 878-886,2001

[5] T. Peng, C. Leckie, and K. Ramamohanarao, “Adjusted Probabilistic Packet Marking for IP Traceback,” Proc. the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications, pp. 697-708, 2002

[6] L. Jenshiuh,L. Zhi-Jian,and C. Yeh-Ching, “Dynamic probabilistic packet marking for efficient IP traceback,” Proc. the International Journal of Computer and Telecommunications Networking, Elsevier North-Holland Press, Feb 2007,pp. 866-882, doi: 10.1016

[7] F. Bo,G. Fan,and Y. Min, “Dynamic Probabilistic Packet Marking Based On PPM,” Proc. WMWA 09. Second Pacific-Asia Conference, pp. 289-292 ,June 2009

[8] G. Dapeng,Y. Shicai,and Y. Wenzhi, “Research on Composed Packet Marking for IP Traceback Algorithm,” Computer Engineering, Vol . 35, pp. 115-117, May 2009(In Chinese).

[9] A. Boneh,and M. Hofri, The Coupon Collector Problem Revisited Commun[J], Static Stochastic Models,1997,pp. 39-66

[10] K. Park,and H. Lee, “On the effectiveness of Probabilistic Packet Marking for IP Traceback under denial of service attack,”Proc. IEEE INFOCOM 2001, IEEE Press ,pp. 338-347,2001

[11] V. Kuznetsov, A. Simkin,and H. Sandstom, “An evaluation of different IP traceback approaches,” Proc. the 4th International Conference on Information and Communications Security, pp. 37-48,2002

[12] L. Stoica,and H. Zhang, “Providing Guaranteed Services Without Per Flow Management,” Proc. the conference on Applications, technologies, architectures, and protocols for computer communication, ACM Press, pp. 81-94,1999

[13] D. Drew,F. Franklin, S. Adam, “An Algebraic Approach to IP Traceback,” Proc. the ACM Transactions on Information and System Security, ACM Press ,pp. 119-137, May 2002

[14] J. Rajahalme,A. Conta,B.Carpenter,and S.Deering, IPv6 Flow Label Specification, RFC 3697,2004.

[15] M. Waldvogel, “GOSSIB vs. IP Traceback Rumors,” Proc. the Computer Security Applications Conference, 2002