Indian Journal of Science and Technology
DOI: 10.17485/ijst/2014/v7i10.6
Year: 2014, Volume: 7, Issue: 10, Pages: 1618–1624
Original Article
Sara Abbasvand1 , Seyyed Nasser Seyyed Hashemi2* and Shahram Jamali3
1 Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran
2 Young Researchers Club, Ardabil Branch, Islamic Azad University, Ardabil, Iran; naser_seyed_hashemi@yahoo.com
3 Department of Computer Engineering, Mohaghegh Ardabili University, Ardabil, Iran
Connection Management phase of TCP is susceptible to a classic attack that is called SYN-flooding. In this attack, source sends many SYN packets to the victim computer, but does not complete three-way handshaking algorithms. This quickly consumes the resources allocated for communication in the under attack system and hence prevents it from serving other connection requests. This attack causes the victim host to populate its backlog queue with forged TCP connections. In other words it increases the number of legal connections rejected due to limited buffer space. In this paper, the under attack system are modeled by using queuing theory and then a game theoretic approach is employed to defend against SYNflooding attacks. The simulation results show that the proposed defense mechanism improves performance of the under attack system in terms of the ration of blocked connections and the buffer space occupied by attack requests.
Keywords: DoS, Game Theory, SYN-flooding Attacks, TCP
Subscribe now for latest articles and news.
