Skip to main content


next previous up

Next 3.2- Viral Spread in Organizations
Previous 3- Two New Models
Up 3- Two New Models

3.1- Kill Signals

In all epidemiological models of which we are aware, an individual's cure takes place independently of that of any other individual. However, consider the following scenario. One day, Alice discovers that one of the programs she uses on her PC is infected with a virus. She eradicates it by any one of a number of procedures. In most models, this would be the end of the story. However, in this case Alice takes it upon herself to inform her friends Bob, Carol, and Dave, with whom she remembers having exchanged software sometime during the last few weeks. Bob already has a virus scanner, so he runs it and finds that, lo and behold, he has the virus, too. Carol and Dave install anti-virus software on their machines, whereupon Carol finds that she is infected, too. Fortunately for Dave, he turns out not to be infected. Bob and Carol, after cleaning up their PCs and diskettes, follow Alice's example and tell their friends, and the process continues until finally no one who receives the ``kill signal'' (the warning about possible viral infection) finds that they have the virus.

Various assumptions can be made about how the kill signal works. If one assumes that the kill signal is delivered and acted upon much more rapidly than the virus can spread, it can be shown that the virus can be pushed below the epidemic threshold even if the infected individual only delivers the kill signal to a fraction of its associates.

Figure 2 summarizes the results of nearly 200,000 simulation runs on random graphs of 100 nodes with average degree 10 (i.e. on average, each node had 10 neighbors). The ratio tex2html_wrap_inline896 was fixed at 0.2. At the beginning of each simulation run, an entirely new random graph was generated, and one randomly-chosen node was infected initially. At the moment that a node became cured, it tried to send a kill signal to each of its neighbors, which received it with probability tex2html_wrap_inline898 . Upon successful receipt of the signal, an infected node would immediately become cured and would instantly try to send a kill signal to each of its neighbors. Any uninfected node would remain uninfected, and would not send the signal on to its neighbors. Given the relatively high degree of the graph and the random nature of the connections, the homogeneous approximation gives a good estimate of the epidemic probability when tex2html_wrap_inline900 : tex2html_wrap_inline902 . As the kill signal probability tex2html_wrap_inline904 is increased, the epidemic probability remains high until a sharp threshold is reached near tex2html_wrap_inline906 , beyond which the probability for there to be an epidemic drops abruptly to zero. In other words, for these parameters, extinction of the virus is inevitable if more than 2.5 or 3 out of a typical node's 10 neighbors receive and heed the kill signal.

  

figure104

Figure 2: Kill signals can be extremely effective, even when only a fraction of the neighbors of an infected node receive and heed them. Each point summarizes the result of 2500 simulation runs on random graphs of 100 nodes with average degree 10, and indicates the fraction of those runs which resulted in epidemics. The ratio tex2html_wrap_inline908 was 0.2.

What if the kill signal is not transmitted instantaneously? One way to model this is to treat the kill signal as an epi-epidemic -- a sort of anti-virus epidemic of species K riding on the back of the virus epidemic (species V). We can then assign the kill signal K its own intrinsic ``adequate contact'' and ``death'' rates. Specifically, a kill signal is born at a node whenever the virus dies there. Adequate contact among nodes occurs at the rate tex2html_wrap_inline916 . In order for adequate contact to result in infection by a K, the intended victim must be infected with V. In order to prevent the kill signal from ricocheting around the system and using up computational resources long after V has been eradicated, we introduce a death rate tex2html_wrap_inline924 . The properties of V remain essentially the same as in standard models; V can only infect nodes that are not infected with K or with V.

In a homogeneous system, deterministic analysis (valid for sufficiently large systems) leads to the following coupled pair of nonlinear differential equations:

 

eqnarray114

Equation 1 can be solved numerically to yield v(t) and k(t), the fraction of nodes occupied by V and K, respectively.

Analysis of the solution shows that the epidemic threshold for the virus is unaffected by the kill signal parameters; it remains at tex2html_wrap_inline942 . The kill signal has no intrinsic epidemic threshold; it can survive as long as there are viruses upon which to feed, regardless of the relative values of tex2html_wrap_inline944 and tex2html_wrap_inline946 . Unlike the first type of kill signal, this second type fails to alter the epidemic threshold. However, it can still be quite effective. By setting the left hand sides of Eq. 1 to zero, one can show that the equilibrium virus population can be made arbitrarily small either by setting tex2html_wrap_inline948 sufficiently low or by setting tex2html_wrap_inline950 sufficiently high.

The kill signal parameters tex2html_wrap_inline952 and tex2html_wrap_inline954 have several interesting limits. The limit tex2html_wrap_inline956 has a simple interpretation: each individual acquires permanent immunity after exposure to and recovery from the virus V. The standard SIR models of mathematical epidemiology (susceptible tex2html_wrap_inline960 infected tex2html_wrap_inline962 recovered) are obtained by further taking the limit tex2html_wrap_inline964 . In this case, K isn't really a signal passed among neighboring nodes; it just appears spontaneously whenever a node is cured of V and remains there for eternity, protecting that node from infection by V. In such models, the equilibrium virus population is always zero; the question of interest is how many nodes ever become infected; this is determined by the virus rates tex2html_wrap_inline972 and tex2html_wrap_inline974  [8]. In the limit tex2html_wrap_inline976 , the kill signal becomes instantaneous. If tex2html_wrap_inline978 is finite, this reproduces the tex2html_wrap_inline980 limit in the first kill-signal model.

Figure 3a illustrates the population dynamics of V and K for a particular set of parameters for which V is above the epidemic threshold: tex2html_wrap_inline988 , tex2html_wrap_inline990 , tex2html_wrap_inline992 , and tex2html_wrap_inline994 . Thus tex2html_wrap_inline996 , but the life cycle of K is ten times slower than that of V. In the absence of the kill signals, the fraction of nodes infected with the virus in equilibrium would have been tex2html_wrap_inline1002 . The kill signals strongly suppress the equilibrium virus population -- by a factor of nearly 16 in this example. The predator-prey oscillations and high initial peak in the fractional virus population could be quelled by making tex2html_wrap_inline1004 much larger. In a practical situation, one might also wish the kill-signal population to be fairly low; this could be achieved by making tex2html_wrap_inline1006 larger (at the expense of increasing the equilibrium virus population).

What is the effect of kill signals in non-homogeneous topologies? In sparse topologies, epidemics can be eliminated entirely, as illustrated by the simulation run shown in Fig. 3b. In this case, all parameters are the same as in Fig. 3a, but the topology is a random graph of 10,000 nodes with average degree 2.0. After a short-lived growth spurt, the virus population becomes extinct near t=16.4. Their supply of viruses having run out, the kill signal population decays exponentially due to the death rate tex2html_wrap_inline1010 , and becomes extinct near t=89.1. In all 200 simulation runs that were conducted under these conditions, V and K never came close to surviving up to the time limit t=1000. Thus it appears that the sparsity of the graph has plunged the system below the epidemic threshold.

  

figure134

Figure 3: The effect of various topologies on the population dynamics of viruses and kill signals: a) homogeneous mixing model, b) 10000-node random graph with d=2.0, and c) 100-by-100 square lattice wrapped around to form a torus. The rates are tex2html_wrap_inline1022 , tex2html_wrap_inline1024 , tex2html_wrap_inline1026 , and tex2html_wrap_inline1028 in all cases. The homogeneous mixing curves are numerical solutions of a coupled pair of differential equations in which the initial fractional populations of V and K were 0.0001 and 0.0, respectively. The 2-D square lattice and random graph curves were obtained from typical simulation runs in which initially just one node (out of 10000 total) was occupied with V and none with K. (Recall that a K is born whenever a V dies.)

In local topologies, kill signals introduce some interesting new effects. Fig. 3c shows the populations of V and K for a typical simulation run on a 100-by-100 square lattice (wrapped around in both dimensions to form a torus). Each node (vertex) of the lattice is only able to infect its eight nearest neighbors. Although the rates tex2html_wrap_inline1046 and tex2html_wrap_inline1048 are identical to those used in the other two topologies presented in Fig. 3, the population dynamics are remarkably different. Initially, the population growth of V and K are quadratic rather than exponential. This is in accord with previous studies which did not include the kill signal [6], in which it was found that the virus population grew as tex2html_wrap_inline1054 in a D-dimensional lattice (t represents time). However, after a while, large undamped oscillations develop in the populations of V and K, and they are centered at a value which is substantially lower than in the homogeneous topology. Large undamped oscillations are not peculiar to spatial topologies; simulations on other topologies suggest that this phenomenon is generally characteristic of local topologies. Locality allows separate pockets of V and K to periodically develop, interact, separate, and then interact again [7].

These theoretical results on kill signals are exciting because they suggest a very cost-effective technique for thwarting viral spread. A number of different implementations can be considered, including user education (getting people to tell their friends if they discover a computer virus) and organizational policies which encourage users to report virus incidents to a central agency, which can then ensure that machines in the vicinity of the infected machine are scanned for viruses (and cleaned up if necessary). We are currently examining the feasibility of a technological implementation of kill signals for use in networks and other multi-user systems.


next previous up

Next 3.2- Viral Spread in Organizations
Previous 3- Two New Models
Up 3- Two New Models


Back To Index