Abstract
Security has become a critical factor in today’s computation systems. The security threats that risk our confidential information can come in form of seemingly legitimate client request to server. While illegitimate requests consume the number of connections a server can handle, no valid new connections can be made. This scenario, named SYN-flooding attacks can be controlled through a fair scheduling algorithm that provides more opportunity to legal requests. This paper proposes a detailed scheduling approach named Largest Processing Time Rejection- Particle Swarm Optimization (LPTR-PSO) that defends the server against varying intensity SYN-flood attack scenarios through a three-phased algorithm. This novel approach considers the number of half-open connections in the server buffer and chooses a phase accordingly. The simulation results show that the proposed defense strategy improves the performance of under attack system in terms of memory occupancy of legal requests and residence time of attack requests.
Highlights
As far as security in data and telecommunications go, technology has sure come a long way, but it still seems to halt at some known stations
Using scheduling approach to detect or identify the SYN attack requests has been proposed before but none of them has been very effective in successfully removing the attack requests and allowing more memory space for legal requests. This principle has been the foundation of the proposed algorithm Largest Processing Time RejectionParticle Swarm Optimization (LPTR-PSO) which uses three separate algorithms for different phases based on the degree of attack to the server
The basic principle of Highest Residence Time Ejection (HRTE) is that it ejects the job with the highest residence time
Summary
As far as security in data and telecommunications go, technology has sure come a long way, but it still seems to halt at some known stations. The second type is where the malicious user is trying to overwhelm system’s resources of the provided service-like memory, CPU or bandwidth, by creating numerous of useless well-formed requests This type of attack is well known as flooding attack [3]. The client receives it and sends an ACK packet to the server This is how a connection is established through three way handshaking and data transfer starts. Using scheduling approach to detect or identify the SYN attack requests has been proposed before but none of them has been very effective in successfully removing the attack requests and allowing more memory space for legal requests This principle has been the foundation of the proposed algorithm Largest Processing Time RejectionParticle Swarm Optimization (LPTR-PSO) which uses three separate algorithms for different phases based on the degree of attack to the server. The rest of the paper is organized as follows: the previous approaches, studies and works related to the addressed premise of this paper are listed in Section 2, proposed algorithm and its working principle along with system model are demonstrated in Section 3, performance analysis and simulation results are included in Section 4 and the conclusion along with future works is stated in Section 5, followed by the references
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
