Journal Title : International Journal of Modern Trends in Engineering and Science

Author’s Name : B Sudhajini | R Renita  unnamed

Volume 03 Issue 09 2016

ISSN no:  2348-3121

Page no: 1-3

Abstract – Now-a-days, IP spoofing becomes a major attack and the need to avert this attack is becoming a significant need. To imprison the spoofers, a number of IP trace back mechanisms have been proposed. The existing system used passive IP trace back (PIT) that finds the location of the spoofers with the help of the mutual information. This existing model illustrates the causes, collection, and the arithmetical results on path backscatter, demonstrates the processes and effectiveness of PIT, and shows the apprehended locations of spoofers through applying PIT on the path backscatter data set. Through the PIT cannot detect all the spoofing, and it take more cost to adopting this mechanism on the routing system. Another difficulty is to make Internet service providers (ISPs) collaborate. Since the spoofers could feast over every place of the world, a single ISP to deploy its own traceback system is almost meaningless. To overcomes these disadvantages, IP Trace back algorithm and Probabilistic packet marking algorithm is our proposed and implemented. The proposed methods do not require that a victim know the topology of the universal tree, we do not require that routers indication any setup messages individually, and we allow for incremental adoption.

Keywords— Probabilistic Packet Marking; IP Traceback;IP Spoofing;Internet Service Provider 


  1. A. Anagnostopoulos, M. T. Goodrich, and R. Tamassia, “Persistent authenticated dictionaries and their applications,” in Proc. Information Security Conf. (ISC 2001), 2001, vol. LNCS 2200, pp. 379–393, Springer-Verlag.
  2. T. Baba and S. Matsuda, “Tracing network attacks to their sources,” IEEE Internet Computing, vol. 6, no. 2, pp. 20–26, 2002.
  3. S. M. Bellovin, “ICMP traceback messages, ”work in Progress, Internet Draft draft-bellovin-itrace-00.txt, Mar. 2000.
  4. H. Burch and B. Cheswick,“Tracing anonymous packets to their approximate source,” in Proc. Usenix LISA (New Orleans) Conf., 2000, pp. 313–322.
  5. D. Dean, M. Franklin, and A. Stubblefield, “An algebraic approach to IP traceback,” in Proc. Network and Distributed System Security Symp. (NDSS), 2001, pp. 3–12.
  6. M. T. Goodrich, “Efficient packet marking for large-scale IP traceback,” in Proc. 9th ACM Conf. Computer and Communications Security (CCS), 2002, pp. 117–126.
  7. M. T. Goodrich, R. Tamassia, and A. Schwerin, “Implementation of an authenticated dictionary with skip lists and commutative hashing,” in Proc. 2001 DARPA Information Survivability Conf. Expo., 2001, vol. 2, pp. 68–82.
  8. J. Ioannidis and S. M. Bellovin, “Implementing Pushback: Router-based defense against DDOS attacks,” in Proc. Network and Distributed System Security Symp., 2002.
  9. T. K. T. Law, D. K. Y. Yau, and J. C. S. Lui, “You can run, but you can’t hide: An effective statistical methodology to trace back DDOS attackers,” IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 9, pp. 799–813, Sep. 2005.
  10. R. Motwani and P. Raghavan, Randomized Algorithms. New York: Cambridge Univ. Press, 1995.
  11. S. Savage, D.Wetherall, A. R. Karlin, and T. Anderson, “Practical network support for IP traceback,” in Proc. ACM SIGCOMM, 2000, pp. 295–306.
  12. A. C. Snoeren, C. Partridge, L. A. Sanchez, C. E. Jones, F. Tchakountio, S. T. Kent, and W. T. Strayer, “Hash-based IP traceback,” in Proc. ACM SIGCOMM 2001 Conf. Applications, Technologies, Architectures, and Protocols for Computer Communication, San Diego, CA, 2001.
  13. D. Song and A. Perrig, “Advanced and authenticated marking schemes for IP traceback,” in Proc. IEEE INFOCOM, 2001, pp. 878–886.