In this paper, we propose a scheme, called Efficient Spoofed Flooding Defense (ESFD), to defend against a DrDoS attack which is generated due to a spoofed flooding attack.
In this section, different scenarios were discussed, with respect to the proposed ESFD. The following section explains the experimental setup and real time formation of the DrDoS attack.
6 shows the graph of the time (in seconds) and the primary memory usage (in GB), and compares the proposed ESFD scheme with the various existing ones, viz, IP Puzzle, Hop count, and without defense schemes, for the attacked system.
These results show that the proposed ESFD scheme initially performs 1% better than the existing IP puzzle scheme, and 5% poorer than the existing Hop count scheme, in utilizing the primary memory.
In the time span of 10 seconds, the attacker's system consumes 1.56 GB of the total memory, and the proposed ESFD consumes only 1.5 GB memory.
Due to the computational overhead caused by the generation and verification of IP puzzles in the existing IP puzzle scheme, and failure in mitigating the attacked packets when increasing the time in the existing Hop count scheme, it uses more primary memory compared to the proposed ESFD scheme.
Due to the overhead caused by the two level check procedure of the proposed ESFD scheme, the CPU utilization is increased considerably, when compared to the attacked system.
Though the other existing schemes for defense like IP puzzle and Hop count schemes reduce the CPU utilization, this reduction is comparatively lesser than that in the proposed ESFD scheme.
In spite of the presence of the computational overhead, the proposed ESFD based system performs as well as the attacked system, where there is no two level checks procedure.
9 shows the graph of the time (in seconds) and the number of packets reaching the server (in numbers) in the proposed ESFD scheme based system, and the other existing schemes.