Abstract
Understanding the dynamics of computer virus (malware, worm) in cyberspace is an important problem that has attracted a fair amount of attention. Early investigations for this purpose adapted biological epidemic models, and thus inherited the so-called homogeneity assumption that each node is equally connected to others. Later studies relaxed this often unrealistic homogeneity assumption, but still focused on certain power-law networks. Recently, researchers investigated epidemic models in arbitrary networks (i.e., no restrictions on network topology). However, all these models only capture push-based infection, namely that an infectious node always actively attempts to infect its neighboring nodes. Very recently, the concept of pull-based infection was introduced but was not treated rigorously. Along this line of research, the present article investigates push- and pull-based epidemic spreading dynamics in arbitrary networks, using a nonlinear dynamical systems approach. The article advances the state-of-the-art as follows: (1) It presents a more general and powerful sufficient condition (also known as epidemic threshold in the literature) under which the spreading will become stable. (2) It gives both upper and lower bounds on the global mean infection rate, regardless of the stability of the spreading. (3) It offers insights into, among other things, the estimation of the global mean infection rate through localized monitoring of a small constant number of nodes, without knowing the values of the parameters.
- Anderson, R. and May, R. 1991. Infectious Diseases of Humans. Oxford University Press.Google Scholar
- Bailey, N. 1975. The Mathematical Theory of Infectious Diseases and Its Applications, 2nd Ed. Griffin, London.Google Scholar
- Barabasi, A. and Albert, R. 1999. Emergence of scaling in random networks. Science 286, 509--512.Google Scholar
Cross Ref
- Barrat, A., Barthlemy, M., and Vespignani, A. 2008. Dynamical Processes on Complex Networks. Cambridge University Press. Google Scholar
Digital Library
- Callaway, D. S., Newman, M. E. J., Strogatz, S. H., and Watts, D. J. 2000. Network robustness and fragility: Percolation on random graphs. Phys. Rev. Lett. 85, 25, 5468--5471.Google Scholar
Cross Ref
- Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., and Faloutsos, C. 2008. Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. 10, 4, 1--26. Google Scholar
Digital Library
- Chandler, D. 1987. Introduction to Modern Statistical Mechanics. Oxford University Press.Google Scholar
- Chen, Z. and Ji, C. 2005. A self-learning worm using importance scanning. In Proceedings of the ACM Workshop on Rapid Malcode (WORM'05). 22--29. Google Scholar
Digital Library
- Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., and Terry, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'87). 1--12. Google Scholar
Digital Library
- Faloutsos, M., Faloutsos, P., and Faloutsos, C. 1999. On power-law relationships of the internet topology. In Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures and Protocols for Computer Communication (SIGCOMM'99). 251--262. Google Scholar
Digital Library
- Ganesh, A., Massoulie, L., and Towsley, D. 2005. The effect of network topology on the spread of epidemics. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom'05).Google Scholar
- Hethcote, H. 2000. The mathematics of infectious diseases. SIAM Rev. 42, 4, 599--653. Google Scholar
Digital Library
- Horn, R. and Johnson, C. 1985. Matrix Analysis. Cambridge University Press. Google Scholar
Digital Library
- Karp, R., Schindelhauer, C., Shenker, S., and Vöcking, B. 2000. Randomized rumor spreading. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'00). 565--574. Google Scholar
Digital Library
- Kempe, D. and Kleinberg, J. 2002. Protocols and impossibility results for gossip-based communication mechanisms. In Proceedings of the 43rdAnnual IEEE Symposium on Foundations of Computer Science (FOCS'02). 471--480. Google Scholar
Digital Library
- Kempe, D., Kleinberg, J., and Demers, A. 2001. Spatial gossip and resource location protocols. In Proceedings of the Symposium on the Theory of Computing (STOC'01). 163--172. Google Scholar
Digital Library
- Kephart, J. and White, S. 1991. Directed-Graph epidemiological models of computer viruses. In Proceedings of the IEEE Symposium on Security and Privacy. 343--361.Google Scholar
- Kephart, J. and White, S. 1993. Measuring and modeling computer virus prevalence. In Proceedings of the IEEE Symposium on Security and Privacy. 2--15. Google Scholar
Digital Library
- Kermack, W. and McKendrick, A. 1927. A contribution to the mathematical theory of epidemics. Proc. Roy. Soc. Lond. A115, 700--721.Google Scholar
Cross Ref
- Li, X., Parker, P., and Xu, S. 2007. Towards quantifying the (in)security of networked systems. In Proceedings of the 21stIEEE International Conference on Advanced Information Networking and Applications (AINA'07). 420--427. Google Scholar
Digital Library
- McKendrick, A. 1926. Applications of mathematics to medical problems. Proc. Edin. Math. Soc. 14, 98--130.Google Scholar
- Medina, A., Lakhina, A., Matta, I., and Byers, J. 2001. Brite: An approach to universal topology generation. In Proceedings of the International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'01). 346--356. Google Scholar
Digital Library
- Molloy, M. and Reed, B. 1995. A critical point for random graphs with a given degree sequence. Rand. Struct. Algor. 6, 161--179. Google Scholar
Digital Library
- Molloy, M. and Reed, B. 1998. The size of the giant component of a random graph with a given degree sequence. Comb. Probab. Comput. 7, 295--305. Google Scholar
Digital Library
- Moreno, Y., Pastor-Satorras, R., and Vespignani, A. 2002. Epidemic outbreaks in complex heterogeneous networks. Euro. Phys. J. B26, 521--529.Google Scholar
- Newman, M. 2003. The structure and function of complex networks. SIAM Rev. 45, 167.Google Scholar
Digital Library
- Newman, M. 2007. Component sizes in networks with arbitrary degree distributions. Phys. Rev. E76, 4, 045101.Google Scholar
- Newman, M. 2010. Networks: An Introduction. Oxford University Press. Google Scholar
Digital Library
- Newman, M. E. J., Strogatz, S. H., and Watts, D. J. 2001. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E64, 2, 026118.Google Scholar
- Pastor-Satorras, R. and Vespignani, A. 2001. Epidemic dynamics and endemic states in complex networks. Phys. Rev. E63, 066117.Google Scholar
- Pastor-Satorras, R. and Vespignani, A. 2002. Epidemic dynamics in finite size scale-free networks. Phys. Rev. E65, 035108.Google Scholar
- Provos, N., McNamee, D., Mavrommatis, P., Wang, K., and Modadugu, N. 2007. The ghost in the browser analysis of web-based malware. In Proceedings of the 1stWorkshop on Hot Topics in Understanding Botnets (HotBots'07). Google Scholar
Digital Library
- Shah, D. 2009. Gossip algorithms. Found. Trends Netw. 3, 1, 1--125. Google Scholar
Digital Library
- Wang, Y., Chakrabarti, D., Wang, C., and Faloutsos, C. 2003. Epidemic spreading in real networks: An eigenvalue viewpoint. In Proceedings of the 22ndIEEE Symposium on Reliable Distributed Systems (SRDS'03). 25--34.Google Scholar
- Wilf, H. 1994. Generating Functionology. Academic Press. Google Scholar
Digital Library
- Willinger, W., Alderson, D., and Doyle, J. 2009. Mathematics and the internet: A source of enormous confusion and great potential. Not. Amer. Math. Soc. 56, 5, 286--299.Google Scholar
- Yoshida, K. 1971. Functional Analysis and Its Applications. Springer.Google Scholar
- Zou, C., Gao, L., Gong, W., and Towsley, D. 2003. Monitoring and early warning for internet worms. In Proceedings of the ACM Conference on Computer and Communications Security (CCS'03), V. Atluri, Ed. ACM Press, New York, 190--199. Google Scholar
Digital Library
- Zou, C., Gong, W., and Towsley, D. 2002. Code red worm propagation modeling and analysis. In Proceedings of the 9thACM Conference on Computer and Communications Security (CCS'02). 138--147. Google Scholar
Digital Library
Index Terms
Push- and pull-based epidemic spreading in networks: Thresholds and deeper insights
Recommendations
Adaptive Epidemic Dynamics in Networks: Thresholds and Control
Special Section on Best Papers from SEAMS 2012Theoretical modeling of computer virus/worm epidemic dynamics is an important problem that has attracted many studies. However, most existing models are adapted from biological epidemic ones. Although biological epidemic models can certainly be adapted ...
Epidemic thresholds in real networks
How will a virus propagate in a real network? How long does it take to disinfect a network given particular values of infection rate and virus death rate? What is the single best node to immunize? Answering these questions is essential for devising ...
A Stochastic Model of Multivirus Dynamics
Understanding the spreading dynamics of computer viruses (worms, attacks) is an important research problem, and has received much attention from the communities of both computer security and statistical physics. However, previous studies have mainly ...








Comments