Abstract

Denial of Service attacks are frequently presenting an increasing threat to the global inter-networking infrastructure in networking area . The algorithm for TCP congestion control algorithm is highly efficient for the various networking areas and operations as well its internal assumption of end-system cooperation results are well prone to attack by high-rate flows. A Shrew attack uses the concept of a low-rate burst which is carefully designed to use the TCP's retransmission timeout mechanism in an unfair way and can affect the bandwidth of a TCP flow in a smooth manner without coming into appearance as an intruder. An Shrew attack has further classifications such as a low rate shrew attack or an high rate shrew attack. A high rated shrew attack uses the concept of timely sending high rate packet stream in low frequency. Such attack can affect the performance of a network to a large extent.

References

• Imad Aad etal, "Transactions on Networking", "Impact of denial of service attacks on Adhoc networks",.
• Y-C. Hu et al, "A Secure on Demend Routing protocol", Mobile Communication 2002,pp:12-33.
• Minda Xiang et al, "Mitigating DDoS attacks using protection nodes in Mobile Adhoc Networks",IEEE 2011.
• Wenyuan Xu "Jamming Sensor Networks: Attack and Defens Strategies. IEEE Network May/June 2006
• A. Hussain, J. Heidemann, and C. Papadopoulos, "A framework for classifying denial of service attacks," in Proc. ACM SIGCOMM '03, Karlsruhe, Germany, Aug. 2003, pp. 99–110.
• C. Gong and K. Sarac, "A more practical approach for single-packet IP traceback using packet logging and marking," IEEE Trans. Parallel Distributed Syst. , vol. 19, no. 10, pp. 1310–1324, Oct. 2008.
• Wei-Shen Lai et al, "Using Adaptive bandwidth a location approach to defend DDoS attacks",ACM 2008.
• A. Hussain, J. Heidemann, and C. Papadopoulos, "A framework for classifying denial of service attacks," in Proc. ACM SIGCOMM '03, Karlsruhe, Germany, Aug. 2003, pp. 99–110.
• B. Al-Duwari andM. Govindarasu, "Novel hybrid schemes employing packet marking and logging for IP traceback," IEEE Trans. Parallel Distributed Syst. , vol. 17, no. 5, pp. 403–418, May 2006.
• C. Gong and K. Sarac, "A more practical approach for single-packet IP traceback using packet logging and marking," IEEE Trans. Parallel Distributed Syst. , vol. 19, no. 10, pp. 1310–1324, Oct. 2008.
• H. Burch and B. Cheswick, "Tracing anonymous packets to their approximate source," in Proc. USENIX LISA 2000, New Orleans, LA, Dec. 2000, pp. 319–327.
• S. Acedanski, S. Deb, M. Medard, and R. Koetter, "How Good Is Random Linear Coding Based Distributed Networked Storage," Proc. Workshop Network Coding, Theory and Applications, Apr. 2005.
• P. A. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm. , Control, and Computing, Oct. 2003.
• C. Gkantsidis and P. R. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. IEEE INFOCOM, pp. 2235-2245, 2005.
• S. Vincent and J. I. Raja, "A Survey of IP Traceback to overcome Denial of service attacks" in Proc. Recent Advances in Networking,VLSI and Signal Processing.
• M. Hour Yang and M. Chein Yang, "RIHT- A Novel Hybrid IP Traceback scheme" in Proc. IEEE Trans on Information Forensics and Security, April 2012, vol. 7,no. 2, pg. 789- 797
• S. Savage, D. Wetherall, A. Karlin, and T. Anderson, "Practical network support for IP traceback," in Proc. ACM SIGCOMM2000, Stockholm, Sweden, Aug. 2000, pp. 295– 306.
• A. C. Snoeren, C. Partridge, L. A. Sanchez, C. E. Jones, F. Tchakountio, B. Schwartz, S. T. Kent, and W. T. Strayer, "Single-packet IP traceback," IEEE/ACM Trans. Networking, vol. 10, no. 6, pp. 721–734, Dec. 2002.