Measuring Vulnerability of Complex Networks by Simulating DDoS Attacks
Date Issued
2010
Author(s)
Kocarev, Ljupcho
Abstract
— In this paper we assess the vulnerability of
different generic complex networks by measuring the
throughput for networks with different load in presence of
Distributed Denial-of-Service (DDoS) attacks. DDoS attacks
are simulated by choosing a number of bot nodes using
several measures, such as: random, degree centrality,
eigenvector centrality, betweenness centrality and k-medoids
clustering algorithm. In order to obtain some information
about the vulnerability of the three different complex
networks (random, small-world and scale-free) we analyze
the useful throughput of these networks in the presence of
DDoS attack by the bot nodes.
different generic complex networks by measuring the
throughput for networks with different load in presence of
Distributed Denial-of-Service (DDoS) attacks. DDoS attacks
are simulated by choosing a number of bot nodes using
several measures, such as: random, degree centrality,
eigenvector centrality, betweenness centrality and k-medoids
clustering algorithm. In order to obtain some information
about the vulnerability of the three different complex
networks (random, small-world and scale-free) we analyze
the useful throughput of these networks in the presence of
DDoS attack by the bot nodes.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
Measuring_Vulnerability_of_Complex_Netwo20160202-30232-1vqcurr-with-cover-page-v2.pdf
Size
332.94 KB
Format
Adobe PDF
Checksum
(MD5):469054af4a1f7fc412358976500442a4
