IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v14y2020i1p27-43.html
   My bibliography  Save this article

Comparison of Various DoS Algorithm

Author

Listed:
  • Mainul Hasan

    (University of Petroleum and Energy Studies, Dehradun, India)

  • Amogh Venkatanarayan

    (University of Petroleum and Energy Studies, Dehradun, India)

  • Inder Mohan

    (University of Petroleum and Energy Studies, Dehradun, India)

  • Ninni Singh

    (University of Petroleum and Energy Studies, Dehradun, India)

  • Gunjan Chhabra

    (University of Petroleum and Energy Studies, Dehradun, India)

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.

Suggested Citation

  • Mainul Hasan & Amogh Venkatanarayan & Inder Mohan & Ninni Singh & Gunjan Chhabra, 2020. "Comparison of Various DoS Algorithm," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 14(1), pages 27-43, January.
  • Handle: RePEc:igg:jisp00:v:14:y:2020:i:1:p:27-43
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.2020010103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisp00:v:14:y:2020:i:1:p:27-43. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.