• DocumentCode
    3073756
  • Title

    Demystifying and Rate Limiting ICMP hosted DoS/DDoS Flooding Attacks with Attack Productivity Analysis

  • Author

    Udhayan, J. ; Anitha, R.

  • Author_Institution
    Dept. of Math. & Comput. Applic., PSG Coll. of Technol., Coimbatore
  • fYear
    2009
  • fDate
    6-7 March 2009
  • Firstpage
    558
  • Lastpage
    564
  • Abstract
    Most attractive and easy to operate ICMP based DoS/DDoS attacks are amplification attacks. Permitting ICMP traffic in a conservative manner will help defending the flooding attacks. Existing methods try to control the ICMP traffic with bandwidth limitation, sometimes the limitation is prodigal and in other cases the limitation is stringent which denies the ICMP traffic completely even the vital usage. However the usage of ICMP over the Internet is necessary, therefore in this paper we identify the harmless rate at which the ICMP traffic can be generated and resounded over the Internet. This harmless rate is achieved through ICMP window restriction scheme. We analyze and prove that the window restriction will remove the attack productivity region from the ICMP traffic and promotes only genuine traffic, thus helps to neutralize the flooding attacks. ICMP window restriction scheme therefore overcomes the issues concerning the unfair vertical limitation in bandwidth.
  • Keywords
    Internet; telecommunication security; telecommunication traffic; transport protocols; ICMP based DoS/DDoS flooding attack; ICMP traffic; ICMP window restriction; Internet control message protocol; amplfication attack; attack productivity analysis; bandwidth limitation; Bandwidth; Broadcasting; Computer applications; Computer crime; Floods; Internet; Local area networks; Productivity; Telecommunication traffic; Testing; Botnet:DDoS; Broadcast; Drones; Intermediary; Relay;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advance Computing Conference, 2009. IACC 2009. IEEE International
  • Conference_Location
    Patiala
  • Print_ISBN
    978-1-4244-2927-1
  • Electronic_ISBN
    978-1-4244-2928-8
  • Type

    conf

  • DOI
    10.1109/IADCC.2009.4809072
  • Filename
    4809072