Game Based Analysis of Distributed DoS Attacks Prevention Using Puzzle-Based Defense Strategy

Security issues have become a major issue in recent years due to the development of technology in networking and its use in vicious way. A number of puzzle-based defense strategies have been established to overcome the flooding denial-of-service (DoS) attack which is eminent in the networks. DoS attacks are aimed at the loss of or the exhaustion in availability, which is one of the most important general security obligations in computer networks. But these strategies are not designed in an optimally and effectively and some of the important issues have been undetermined. This paper contributes detailed analysis of game theory based approach to create a series of defense strategies using puzzles for handling increasing convoluted flooding attacks. In the defense strategies proposed, the defender adopts the Nash equilibrium prescription that brings him the maximum possible repeated game payoff while precluding the attack. In this way, the defense strategy would be optimal. This study concludes in a scenario for managing distributed DoS attacks from an obscure number of sources.