Please use this identifier to cite or link to this item:
Title: Measuring Vulnerability of Complex Networks by Simulating DDoS Attacks
Authors: Mishkovski, Igor 
Filiposka, Sonja 
Trajanov, Dimitar 
Kocarev, Ljupcho
Keywords: Complex networks, DDoS attacks, Network Utility Maximization, Vulnerability
Issue Date: 2010
Conference: 18th Telecommunications forum TELFOR 2010
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.
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers

Files in This Item:
File Description SizeFormat 
Measuring_Vulnerability_of_Complex_Netwo20160202-30232-1vqcurr-with-cover-page-v2.pdf332.94 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Jun 18, 2024


checked on Jun 18, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.