On certain behavior of scale-free networks under malicious attacks

Authors:
Tomasz Gierszewski;Wojciech Molisz;Jacek Rak
Affiliations:
Gdansk University of Technology, Gdansk, Poland;Gdansk University of Technology, Gdansk, Poland;Gdansk University of Technology, Gdansk, Poland
Venue:
SAFECOMP'06 Proceedings of the 25th international conference on Computer Safety, Reliability, and Security
Year:
2006

Citing 5
Cited 0

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Power laws and the AS-level internet topology

IEEE/ACM Transactions on Networking (TON)
Region protection/restoration scheme in survivable networks

MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
WDM optical communication networks: progress and challenges

IEEE Journal on Selected Areas in Communications
A comprehensive study on next-generation optical grooming switches

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper evaluates performance of scale-free networks in case of intentional removal of their nodes. The distinguishing feature of this kind of networks (Internet is an excellent example) is the power law distribution of node degrees. An interesting behavior of scale-free networks, if node removal process is performed sufficiently long, is manifested by their migration to random networks. The main idea of our research is to quantify this process. In contrast to well explored parameters like: characteristic path length or clustering coefficient, we propose the new ones: mean maximum flow, centre of gravity of node degree distribution and other. To the best of our knowledge, these measures are proposed for the first time. Our results confirm that the migration process steps relatively fast.