Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/25092
Title: Game Theoretic Approach for Discovering Vulnerable Links in Complex Networks
Authors: Mishkovski, Igor 
Filiposka, Sonja 
Gramatikov, Sasho 
Trajanov, Dimitar 
Kocarev, Ljupcho
Keywords: Complex Networks, Vulnerability, Game Theory, Network Topology
Issue Date: 2010
Publisher: Springer Netherlands
Journal: Novel Algorithms and Techniques in Telecommunications and Networking
Abstract: Complex networks have been an up-and-coming exciting field in the realm of interactions. With their widespread use appearing on the horizon it is ever more vital to be able to measure their vulnerability as a function of their topology. Precisely, discovering vulnerable links, disposed to attacks, can help in hardening these links and by that providing more secure and reliable network structure. This paper addresses the link vulnerability of different topologies of complex networks such as: random networks, geographic random networks, small world networks and scale-free networks. We introduce measure for vulnerability of complex networks, and prove by simulations that network vulnerability heavily depends on the network topology.
URI: http://hdl.handle.net/20.500.12188/25092
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles

Files in This Item:
File Description SizeFormat 
Game_Theoretic_Approach_for_Discovering_Vulnerable.pdf357.09 kBAdobe PDFView/Open
Show full item record

Page view(s)

33
checked on Apr 19, 2024

Download(s)

5
checked on Apr 19, 2024

Google ScholarTM

Check


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