A new worm exploiting IPv4-IPv6 dual-stack networks
Proceedings of the 2007 ACM workshop on Recurring malcode
Orientation accuracy analysis of multiple satellite networks using epidemic model
International Journal of Systems Science
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Stabilization of complex switched networks with two types of delays via impulsive control
ACC'09 Proceedings of the 2009 conference on American Control Conference
The spread of interacting agents in scale-free networks
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Malware propagation in online social networks: nature, dynamics, and defense implications
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Epidemic data survivability in unattended wireless sensor networks
Proceedings of the fourth ACM conference on Wireless network security
International Journal of Information and Computer Security
| Hi-index | 0.00 |
This paper considers the spread of worms in computer networks using insights from epidemiology and percolation theory. We provide three new results. The first result refines previous work showing that epidemics occur in scale-free graphs more easily because of their structure. We argue, using recent results from random graph theory that for scaling factors between 0 and ∼3.4875, any computer worm infection of a scale-free network will become an epidemic. Our second result uses this insight to provide a mathematical explanation for the empirical results of Chen and Carley, who demonstrate that the Countermeasure Competing strategy can be more effective for immunizing networks to viruses or worms than traditional approaches. Our third result uses random graph theory to contradict the current supposition that, for very large networks, monocultures are necessarily more susceptible than diverse networks to worm infections.