Defense against SYN Flooding Attacks: A Scheduling Approach

The tcp connection management protocol sets a position for a classic denial of service (dos) attack, called the syn flooding attack. in this attack attacker sends a large number of tcp syn segments, without completing the third handshaking step to quickly exhaust connection resources of the victim server. therefore it keeps tcp from handling legitimate requests. this paper proposes that syn flooding attack can be viewed metaphorically as result of an unfair scheduling that gives more opportunity to attack requests but prevents legal connections from getting services. in this paper, we present a scheduling algorithm that ejects the half connection with the longest duration, when number of half open connections reaches to the upper bound. the simulation results show that the proposed defense mechanism improves performance of the under attack system in terms of loss probability of requests and share of regular connections from system resources.