Distributed Denial of Service Attacks : Analysis of Defenses

Eric Chan-Tin

ISBN 10: 3639179528 / ISBN 13: 9783639179521

Published by VDM Verlag Dr. Müller, 2009

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Distributed Denial of Service (DDoS) attacks areattempts to overwhelm a computer system in order todeny access by legitimate users. They are generallyunstoppable, but there is a good deal of on-goingresearch on methods to reduce their negative effects.This paper will deal with the design of a model thatsimulates such an attack. The simulation model isthen used to study possible ways to defend againstthese attacks. Three experiments are run: 1) using apriority queue to sort messages from clients based onhow many connections they have open on the server; 2)limiting the number of connections each client cancreate; and 3) having the server forcefully deletethe oldest established connection, whenever itsconnection table becomes full. Results show thatmethod 1 is totally ineffective while method 2somewhat improves the overall performance of thesystem. However, method 3, combined with method 2,produces significantly improved performance against aDDoS attack.

Seller Inventory # 9783639179521

Bibliographic Details

• Title: Distributed Denial of Service Attacks : Analysis of Defenses
• Publisher: VDM Verlag Dr. Müller
• Publication Date: 2009
• Language: English
• ISBN 10: 3639179528
• ISBN 13: 9783639179521
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 5D millimeters 220 millimeters width by 150 millimeters height by 5 millimeters depth
• Weight: 134 grams

About this title

Synopsis

Distributed Denial of Service (DDoS) attacks are attempts to overwhelm a computer system in order to deny access by legitimate users. They are generally unstoppable, but there is a good deal of on-going research on methods to reduce their negative effects. This paper will deal with the design of a model that simulates such an attack. The simulation model is then used to study possible ways to defend against these attacks. Three experiments are run: 1) using a priority queue to sort messages from clients based on how many connections they have open on the server; 2) limiting the number of connections each client can create; and 3) having the server forcefully delete the oldest established connection, whenever its connection table becomes full. Results show that method 1 is totally ineffective while method 2 somewhat improves the overall performance of the system. However, method 3, combined with method 2, produces significantly improved performance against a DDoS attack.

About the Author

Eric Chan-Tin, echantin@alumni.macalester.edu. Ph.D. Computer Science (Expected 2011), Master of Science, Univ. of Minnesota. Research interests in network security, peer-to-peer (P2P) network, anonymity/privacy, botnets, and network coordinate systems; B.A. Computer Science and Mathematics, Macalester College. For a full CV, contact the author.