Thresholds for virus spread on networks

  title={Thresholds for virus spread on networks},
  author={M. Draief and Ayalvadi J. Ganesh and Laurent Massouli{\'e}},
  booktitle={valuetools '06},
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a model in which each host can be in one of 3 possible states - susceptible, infected or removed (cured, and no longer susceptible to infection). We characterise how the size of the population that eventually becomes infected depends on the network topology. Specifically, we show that if the ratio of cure to infection… 
On the Accuracy of Deterministic Models for Viral Spread on Networks
This work shows that when most vertex degrees in the contact network are sufficiently large, the population behavior concentrates around an ODE known as the network SIR model, and shows that if the contactnetwork has an expander-type property or the initial set of infections is wellmixed in the population, the networkSIR model reduces to the classical SIR models.
Epidemic Model on the Computer Viruses in the Network
Results show the positive impact of increasing security mea sures on virus propagation in computer network and efficiency of antivirus software and crashing of the nodes due to virus attack crit ically analyzed.
Epidemics of computer viruses: A complex-network approach
Efficient control of epidemics over random networks
  • M. Lelarge
  • Computer Science, Mathematics
  • 2009
A new model generalizing both the basic contact model and the bootstrap percolation is introduced, which provides a necessary and sufficient condition under which a single node can trigger a large cascade.
On the expected total number of infections for virus spread on a finite network
In this paper we consider a simple virus infection spread model on a finite population of n agents connected by some neighborhood structure. Given a graph G on n vertices, we begin with some fixed
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks
We study epidemic spreading according to a Susceptible-Infectious-Recovered (for short, SIR) network model known as the Reed-Frost model, and we establish sharp thresholds for two generative models
Differential Epidemic Model of Virus and Worms in Computer Network
It is shown that the virus-worm- infection-free equilibrium, whose component of infective is zero, is globally asymptotically stable if threshold number is less than one, and unstable if it is greater than one.
The combined impact of external computers and network topology on the spread of computer viruses
A new virus epidemic model is proposed that assumes that the network underlying a recently proposed model capturing virus spreading behaviour under the influence of external computers follows a power-law degree distribution and shows the global stability of the virus-free equilibrium or the global attractivity of the viral equilibrium.
Network protection against worms and cascading failures using modularity partitioning
This paper proposes a link isolation strategy based on the quarantining of susceptible clusters in the network that aims to maximize the epidemic control while minimizing the impact on the clusters performance.


The effect of network topology on the spread of epidemics
  • A. Ganesh, L. Massoulié, D. Towsley
  • Mathematics, Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.
On the spread of viruses on the internet
The contact process on random graphs generated according to the preferential attachment scheme as a model for the spread of viruses in the Internet is analyzed and an interesting dichotomy is discovered: for a virus with effective spread rate λ, if the infection starts at a typical vertex, then it develops into an epidemic with probability λΘ(log(1/λ)/log log( 1/λ), but on average the epidemic probability is λ Θ(1).
Epidemic spreading in scale-free networks.
A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
Epidemics with two levels of mixing
We consider epidemics with removal (SIR epidemics) in populations that mix at two levels: global and local. We develop a general modelling framework for such processes, which allows us to analyze the
Throttling viruses: restricting propagation to defeat malicious mobile code
  • Matthew M. Williamson
  • Computer Science
    18th Annual Computer Security Applications Conference, 2002. Proceedings.
  • 2002
A simple technique to limit the rate of connections to "new" machines that is remarkably effective at both slowing and halting virus propagation without affecting normal traffic is described.
A contribution to the mathematical theory of epidemics
The present communication discussion will be limited to the case in which all members of the community are initially equally susceptible to the disease, and it will be further assumed that complete immunity is conferred by a single infection.
Poisson Approximation for the Final State of a Generalized Epidemic Process
A so-called generalized epidemic model is considered that describes the spread of an infectious disease of the SIR type with any specified distribution for the infectious period. The statistic under
Eigenvalues of Random Power law Graphs
Abstract. Many graphs arising in various information networks exhibit the "power law" behavior –the number of vertices of degree k is proportional to k-β for some positive β. We show that if β > 2.5,
Vigilante: end-to-end containment of internet worms
Vigilante, a new end-to-end approach to contain worms automatically that addresses limitations of network-level techniques, can automatically contain fast-spreading worms that exploit unknown vulnerabilities without blocking innocuous traffic.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.