Reference Hub6
Comparison of Various DoS Algorithm

Comparison of Various DoS Algorithm

Mainul Hasan, Amogh Venkatanarayan, Inder Mohan, Ninni Singh, Gunjan Chhabra
Copyright: © 2020 |Volume: 14 |Issue: 1 |Pages: 17
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781799805359|DOI: 10.4018/IJISP.2020010103
Cite Article Cite Article

MLA

Hasan, Mainul, et al. "Comparison of Various DoS Algorithm." IJISP vol.14, no.1 2020: pp.27-43. http://doi.org/10.4018/IJISP.2020010103

APA

Hasan, M., Venkatanarayan, A., Mohan, I., Singh, N., & Chhabra, G. (2020). Comparison of Various DoS Algorithm. International Journal of Information Security and Privacy (IJISP), 14(1), 27-43. http://doi.org/10.4018/IJISP.2020010103

Chicago

Hasan, Mainul, et al. "Comparison of Various DoS Algorithm," International Journal of Information Security and Privacy (IJISP) 14, no.1: 27-43. http://doi.org/10.4018/IJISP.2020010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Denial of service attack is one of the most devastating and ruinous attacks on the internet. The attack can be performed by flooding the victim's machine with any kind of packets. Throughout all these years many methods have been proposed to reduce the impact, but with machines of higher capabilities coming in, the attack has also become more potent, and these proposals are either less effective or less efficient. A DoS attack exhausts the victim's resources affecting the availability of the resource. This paper will be comparing a few methods that have been proposed and published in various papers along with a newly proposed method. The comparison of the methods is done on a number of parameters including resource utilization, reaction time, worst case scenarios, etc. This paper also checks the viability of these methods over various layers of the network. Concluding with the best aspects of all the papers and the best among these for the current real conditions.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.