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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 4,65 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783639179521_new
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783639179521
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: L0-9783639179521
Cantidad disponible: Más de 20 disponibles
Librería: California Books, Miami, FL, Estados Unidos de America
Condición: New. Nº de ref. del artículo: I-9783639179521
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. 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. Nº de ref. del artículo: 9783639179521
Cantidad disponible: 2 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
Paperback. Condición: New. Nº de ref. del artículo: 6666-IUK-9783639179521
Cantidad disponible: 10 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLING22Oct2817100450321
Cantidad disponible: Más de 20 disponibles