- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Discrete Dynamics in Nature and Society

Volume 2012 (2012), Article ID 259671, 11 pages

http://dx.doi.org/10.1155/2012/259671

## Towards the Epidemiological Modeling of Computer Viruses

^{1}School of Electronic and Information Engineering, Southwest University, Chongqing 400715, China^{2}College of Computer Science, Chongqing University, Chongqing 400044, China

Received 25 July 2012; Accepted 20 August 2012

Academic Editor: Yanbing Liu

Copyright © 2012 Xiaofan Yang and Lu-Xing Yang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Epidemic dynamics of computer viruses is an emerging discipline aiming to understand the way that computer viruses spread on networks. This paper is intended to establish a series of rational epidemic models of computer viruses. First, a close inspection of some common characteristics shared by all typical computer viruses clearly reveals the flaws of previous models. Then, a generic epidemic model of viruses, which is named as the SLBS model, is proposed. Finally, diverse generalizations of the SLBS model are suggested. We believe this work opens a door to the full understanding of how computer viruses prevail on the Internet.

#### 1. Introduction

As a technical term coined by Cohen, a computer virus is a malicious program that can replicate itself and spread from computer to computer. Once breaking out, a virus can perform devastating operations such as modifying data, deleting data, deleting files, encrypting files, and formatting disks [1]. In the past, massive outbreaks of computer viruses have brought about huge financial losses. With the advent of the era of cloud computing and the Internet of Things, the threat from viruses would become increasingly serious, even leading to a havoc [2]. As we all know, antivirus software is the major means of defending against viruses. With the continual emergence of new variants of existing viruses as well as new types of virus strains, the struggle waged by human being against viruses is doomed to be endless, arduous, and devious; indeed, the development of new types of antivirus software always lags behind the emergence of new types of viruses. As thus, antivirus technique cannot predict the evolution trend of viruses and, hence, cannot provide global suggestions for their prevention and control.

Inspired by the intriguing analogies between computer viruses and their biological counterparts, Cohen [3] and Murray [4] inventively suggested that the techniques developed in the epidemic dynamics of infectious diseases should be exploited to study the spread of computer viruses. Later, Kephart and White [5] borrowed a biological epidemic model (the SIS model) to investigate the way that computer viruses spread on the Internet. The researches in this field have since been made mainly in the following two different directions.

(i) The finding that the autonomous system level topological structure of the Internet follows diverse power law distributions [6–8] has stimulated the interest in the spreading behavior of viruses on complex networks. Previous work in this direction focused on the existence and estimation of the epidemic threshold under the SI model [9, 10], the SIS model [11–21], and the SIR model [19, 21–24], leading to the most surprising finding that the epidemic threshold vanishes for scale-free networks with infinite size [11]. Due to the extreme diversity of topologies of large-sized complex networks, the global stability of the endemic equilibrium, if present, was examined experimentally rather than theoretically. Although Pastor-Satorras and Vespignani [11] indicated the necessity of studying other types of epidemic models on complex networks, to our knowledge no relevant work has been reported in the literature.

(ii) The strong desire to understand the spread mechanism of computer viruses has motivated the proposal of a variety of epidemic models that are based on fully connected networks, that is, networks where each computer is equally likely to be accessed by any other computer. Previous work in this direction was focused mainly on the theoretical study of complex dynamical properties of the models, such as the global stability of equilibria, the emergence of periodic solutions, and the occurrence of chaotic phenomena [25–34].

The epidemic dynamics of computer viruses is still in its infancy. While previous models lay emphasis on the similarity between computer viruses and infectious diseases, the majority of them more or less neglect the intrinsic difference between them.

This paper is intended to present a series of rational epidemic models of computer viruses. A close inspection of the characteristics of computer viruses reveals the flaws of previous models. On this basis, a generic epidemic model of viruses, which is known as the SLBS model, is proposed. By taking into account the impact of various factors, such as the impulsive emergence of new viruses, the impulsive succeed in the development of new antivirus software, and the fluctuation of the system parameters, a variety of generalizations of the SLBS model are suggested. We believe the proposed models open a door to the macroscopic understanding of the spread of computer viruses on the Internet.

The subsequent materials are organized this way: Section 2 elucidates the defects of previous models. Sections 3 and 4 formulate the SLBS model and some of its generalizations, respectively. Finally, This work is summarized in Section 5.

#### 2. Flaws of Previous Models

##### 2.1. Basic Terminologies

For convenience, let us introduce the following terminologies.

A computer is referred to as * internal* or * external* depending on whether it is connected to the Internet or not.

A computer is referred to as * infected* or * uninfected* depending on whether there is a virus staying in it or not.

A computer is referred to as the * host computer* of a virus if the virus has entered it and is staying in it. By the * life cycle* of a virus we mean the interval from the time it enters its host computer to the time it is eradicated. By the * lifetime* of a virus, we mean the length of its life cycle. The lifetime of a virus is not fixed. Rather, it is affected by a multiplicity of factors.

##### 2.2. Principle of Computer Viruses

The ultimate goal of a clever computer virus is to devastate as many computer systems as possible. To realize that goal, the virus would try to stealthily infect as many computers as possible before it finally breaks out. As thus, a typical virus would undergo two consecutive phases: the * latent period*, that is, the interval from the time the virus enters its host computer to the time exactly before it inflicts damage on the host system, and the * breaking-out period*, that is, the interval from the time the virus begins to inflict damage to the time it is wiped out. In this paper, we will always assume that, in its life cycle, a virus has both latent and breaking-out periods. Furthermore, an infected computer will be referred to as *latent* or * breaking-out* depending on whether all viruses staying in it are in their respective latent periods or at least one virus staying in it is in its breaking-out period.

##### 2.3. A Common Flaw of Models with Compartment

For some biological infectious diseases, an infected individual may experience a particular period, named as the * exposed period*, before having infectivity [35]. So, the corresponding epidemic models must have a separate compartment, that is, the compartment of all exposed individuals. Some previous epidemic models of computer viruses were established by borrowing biological epidemic models with compartment, implying the prior assumption that some infected computers possess no infectivity [25, 29–31, 36–39].

The most striking characteristic shared by all computer viruses is their infectivity. On one hand, once infected with a narrowly defined virus, a computer possesses infectivity immediately, because it can infect other computers through sending emails with infected attachments or transmitting infected files. On the other hand, once infected with a worm, a computer also possesses infectivity immediately, because it can infect those computers with specific system vulnerabilities. Therefore, in the real world there exists no infected computer at all that has no infectivity. Equivalently, there exists no exposed computer, implying that a rational epidemic model of computer viruses should have no compartment.

##### 2.4. A Common Flaw of Models with All Infected Computers in a Single Compartment

Most previous epidemic models of computer viruses have all infected computers in a single compartment, that is, neither of these models makes a further classification of the infected computers [9–28, 32–34, 40–42].

On one hand, the cure rate of an infected computer, that is, the probability with which it is cured, is a major concern in the modeling process. Indeed, a breaking-out computer can get treated with a higher probability, because it usually suffers from a marked performance degradation or even breaks down, which can be perceived evidently by the user. In contrast, a latent computer can get treatment only with a much lower probability, because it usually can work normally and hence the user cannot become aware of the presence of any virus at all. In the context of epidemiological modeling, therefore, there is a clear distinction between latent computers and breaking-out computers.

On the other hand, as opposed to a latent internal computer, a breaking-out internal computer has a higher probability to be disconnected from the Internet, because the possible system breakdown caused by the virus outbreak would yield the disconnection automatically.

In conclusion, a sound epidemic model of computer viruses should possess a compartment of all latent computers ( compartment) and a compartment of all breaking-out computers ( compartment) simultaneously.

##### 2.5. A Common Flaw of Models with Permanent Compartment

Some previous epidemic models of computer viruses have a permanent compartment, that is, the compartment of all uninfected computers having permanent immunity [19, 21–24, 26–31]. Such models are especially suitable for a specific computer virus.

When modeling the spread of a large family of existing and future viruses sharing a small number of common features, all currently uninfected computers worldwide will always be confronted with the threat from new variants of existing viruses as well as new virus strains. As thus, it is likely that a computer that has previously been cured be infected by new kinds of viruses, implying that no computer can acquire permanent immunity. In a word, a model that aims to capture the spread of a large family of computer viruses should not possess a permanent compartment.

#### 3. The SLBS Model: A Generic Model

This section is intended to propose a generic epidemic model of computer viruses. Based on the previous discussions, all internal computers are classified as three categories: uninfected internal computers ( computers), latent internal computers ( computers), and breaking-out internal computers ( computers). In parallel, all external computers are classified as three categories: uninfected external computers ( computers), latent external computers ( computers), and breaking-out external computers ( computers). Let , , and denote the numbers of , , and computers at time , respectively. Next, let us impose the following assumptions.(A1) The Internet is fully connected, that is, every internal computer is equally probable to be accessed by any other internal computer. (A2) computers are connected to the Internet at constant rate , while computers are connected to the Internet at constant rate . Let . (A3) In normal case, every internal computer is disconnected from the Internet with constant probability . (A4) Due to the outbreak of viruses, every computer is disconnected from the Internet with constant probability . (A5) Due to the contact with infected removable storage media, every computer is infected with constant probability . (A6) Due to the outbreak of viruses, every computer becomes a computer with constant probability . (A7) Due to the contact with or computers, at time every *S* computer becomes an computer with probability , where the function is continuously differentiable. (A8) Every computer is cured with constant probability , every computer is cured with constant probability , and every computer is partially cured, that is, becomes an computer, with constant probability . Based on this collection of assumptions, the corresponding mean-field model, which will be referred to as the * SLBS model*, is formulated as
where , , and .

Based on the following reasons, the SLBS model is well qualified to serve as one of the most fundamental epidemic models of computer viruses.(i)This model captures the main features of computer viruses. (ii)Most factors that have conspicuous effect on the diffusion of viruses are incorporated into this model. (iii)As a generic model, this model includes as special cases a large number of particular models of interest. (iv)More complicated spread mechanisms of viruses can be characterized by modifying or extending this model properly.

Now, let us give a brief analysis of the SLBS model. First, assume every or computer infects any computer mutually independently and with constant probability . A simple calculation gives Suppose , which is consistent with actual conditions. There are three possibilities, which are listed as follows:(i). Then ; (ii). Then ; (iii). Then .

Second, let . Then If , then , implying . After a moment of reflection, it can be seen that, for arbitrarily small , the simply connected compact set is positively invariant for the SLBS model.

Finally, the SLBS model would have a unique virus-free equilibrium if . Otherwise, this model would have no virus-free equilibrium. As far as the SLBS model is concerned, the following problems are yet to be studied:(i)stability of the virus-free equilibrium, if it exists, (ii)existence and number of endemic equilibria, as well as their respective stabilities, (iii)more complex dynamic behaviors, such as bifurcations and chaos, of the model.

Very recently, the authors [43–45] proposed three new models, which are formally analogous to special instances of the SLBS model. All of the three models, however, assume that the number of computers connected to the Internet keeps constant, which is not perfectly consistent with actual conditions. The proposed SLBS model removes that unrealistic assumption and, hence, can better describe the epidemics of viruses.

#### 4. Some Generalizations of the SLBS Model

##### 4.1. The Impulsive SLBS Model

From the smoothness of the right-hand-sided functions in the SLBS model, it can be concluded that the solutions to the model are all smooth. In reality, however, the emergence of a new type of viruses often leads to a sharp rise in the number of infected computers. Likewise, the appearance of a new type of patches could yield a drastic drop in the number of infected computers. In this context, the SLBS model should be modified by incorporating impulsive terms.

Let , , denote the sequence of time instants at each of which the number of infected computers rises rapidly, and let , , denote the sequence of time instants at each of which the number of infected computers falls dramatically. Let us adopt the assumptions (A1)–(A6) imposed in the SLBS model, and modify the assumptions (A7)-(A8) in the following fashion.(A7’) If for some , exactly computers are infected simultaneously at time , where is a constant. Otherwise, the assumption is the same as (A7). (A8’) If for some , exactly computers are cured simultaneously at time , exactly computers are cured simultaneously at time , and exactly *B* computers are partially cured, that is, become computers, simultaneously at time . Otherwise, the assumption is the same as (A8).

Based on this collection of assumptions, the corresponding model, which will be referred to as the * impulsive SLBS model*, is formulated as

The impulsive SLBS model is a generic model, which subsumes the following two particular models of interest:

(i) * Impulsive toxication model*, which is formulated as

(ii) * Impulsive detoxication model*, which is formulated as

##### 4.2. A Consideration of the Delay Terms

There are three potential delay factors that have notable influence on the spread of computer viruses.(i)Due to the time cost needed to develop new viruses, there is a delay from the time a *B* computer is cured to the time this computer is infected again. (ii)Due to the intrinsic latent period of viruses, there is a delay from the time an computer is infected to the time this computer breaks out. (iii)Due to the time cost needed to develop new patches, there is a delay from the time an computer breaks out to the time this computer is cured.

A question arises: is it necessary to incorporate delay terms in the standard SLBS model? In order to answer this question, let us make a brief analysis from four aspects.(i)The SLBS model assumes that an computer is infected randomly, which implicitly includes a time delay in developing new viruses. (ii)The SLBS model supposes that an computer breaks out randomly, which, to a certain extent, implies a latency-related delay. (iii)The SLBS model postulates that a computer is cured randomly, which, in some sense, also implies a time delay in developing new antivirus software. (iv)The incorporation of delay terms in the SLBS model would greatly enhance the hardness in the theoretical study of the resulting models.

Due to these reasons, we do not suggest to study SLBS models incorporated with delay terms.

##### 4.3. The Stochastic SLBS Model

All of the above-mentioned models are based on the assumption that all system parameters do not change with time. In reality, however, there are numerous uncertain factors, which are often abstracted as noises, that have significant influence on these parameters. As a result, some or all system parameters are constantly varying with time. Therefore, the predictions made from any deterministic model may have a significant deviation from the actual condition.

An alternative to the deterministic modeling of viruses is to incorporate noises in some or all system parameters so as to form a stochastic model. As an instance, noise terms can be incorporated in the and parameters of the original SLBS model to produce a particular stochastic SLBS model of the form where and stand for the standard one-dimensional Wiener processes (i.e., Brownian motions) and and stand for the standard deviations associated with and , respectively.

#### 5. Concluding Remarks

By inspecting the characteristics of computer viruses carefully, the flaws of some previous epidemic models of viruses have been indicated. On this basis, a generic epidemic model of viruses (the SLBS model) has been established, and some of its generalizations have been suggested.

Towards this direction, a great diversity of particular models with parameter restrictions are yet to be investigated. Besides, the standard SLBS model is based on fully connected networks and hence cannot capture the effect of the topological structure of the Internet on the spread of computer viruses. It would be highly rewarding to study the qualitative properties of the SLBS model on scale-free networks.

#### Acknowledgments

The authors are grateful to the anonymous reviewers for their valuable comments. This work is supported by Doctorate Foundation of Educational Ministry of China (Grant no. 20110191110022).

#### References

- P. Szor,
*The Art of Computer Virus Research and Defense*, Addison-Wesley, 2005. - K. Hwang, G. C. Fox, and J. J. Dongarra,
*Distributed and Cloud Computing: From Parallel Processing to the Internet of Things*, Elsevier, 2012. - F. Cohen, “Computer viruses. Theory and experiments,”
*Computers and Security*, vol. 6, no. 1, pp. 22–35, 1987. View at Google Scholar · View at Scopus - W. H. Murray, “The application of epidemiology to computer viruses,”
*Computers and Security*, vol. 7, no. 2, pp. 139–145, 1988. View at Google Scholar · View at Scopus - J. O. Kephart and S. R. White, “Directed-graph epidemiological models of computer viruses,” in
*Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy*, pp. 343–358, May 1991. View at Scopus - M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the Internet topology,”
*ACM SIGCOMM Computer Communication Review*, vol. 29, no. 4, pp. 251–262, 1999. View at Google Scholar - R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,”
*Reviews of Modern Physics*, vol. 74, no. 1, pp. 47–97, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - E. Ravasz and A. L. Barabasi, “Hierarchical organization in complex networks,”
*Physical Review E*, vol. 27, no. 2, Article ID 026112, 7 pages, 2003. View at Publisher · View at Google Scholar - M. Barthélemy, A. Barrat, R. Pastor-Satorras, and A. Vespignani, “Velocity and hierarchical spread of epidemic outbreaks in scale-free networks,”
*Physical Review Letters*, vol. 92, no. 17, Article ID 178701, 4 pages, 2004. View at Publisher · View at Google Scholar · View at Scopus - M. Karsai, M. Kivelä, R. K. Pan et al., “Small but slow world: how network topology and burstiness slow down spreading,”
*Physical Review E*, vol. 83, no. 2, Article ID 025102, 4 pages, 2011. View at Publisher · View at Google Scholar · View at Scopus - R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,”
*Physical Review Letters*, vol. 86, no. 14, pp. 3200–3203, 2001. View at Publisher · View at Google Scholar · View at Scopus - R. Pastor-Satorras and A. Vespignani, “Epidemic dynamics and endemic states in complex networks,”
*Physical Review E*, vol. 63, no. 6, Article ID 066117, 8 pages, 2001. View at Google Scholar · View at Scopus - A. L. Lloyd and R. M. May, “How viruses spread among computers and people,”
*Science*, vol. 292, no. 5520, pp. 1316–1317, 2001. View at Publisher · View at Google Scholar · View at Scopus - R. Pastor-Satorras and A. Vespignani, “Immunization of complex networks,”
*Physical Review E*, vol. 65, no. 3, Article ID 036104, 8 pages, 2002. View at Publisher · View at Google Scholar · View at Scopus - Z. Dezsö and A. L. Barabási, “Halting viruses in scale-free networks,”
*Physical Review E*, vol. 65, no. 5, Article ID 055103, 4 pages, 2002. View at Publisher · View at Google Scholar · View at Scopus - L. Billings, W. M. Spears, and I. B. Schwartz, “A unified prediction of computer virus spread in connected networks,”
*Physics Letters A*, vol. 297, no. 3-4, pp. 261–266, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - M. Boguñá, R. Pastor-Satorras, and A. Vespignani, “Absence of epidemic threshold in scale-free networks with degree correlations,”
*Physical Review Letters*, vol. 90, no. 2, Article ID 028701, 4 pages, 2003. View at Google Scholar · View at Scopus - J. C. Wierman and D. J. Marchette, “Modeling computer virus prevalence with a susceptible-infected-susceptible model with reintroduction,”
*Computational Statistics & Data Analysis*, vol. 45, no. 1, pp. 3–23, 2004. View at Publisher · View at Google Scholar - C. Griffin and R. Brooks, “A note on the spread of worms in scale-free networks,”
*IEEE Transactions on Systems, Man, and Cybernetics B*, vol. 36, no. 1, pp. 198–202, 2006. View at Publisher · View at Google Scholar · View at Scopus - X. Fu, M. Small, D. M. Walker, and H. Zhang, “Epidemic dynamics on scale-free networks with piecewise linear infectivity and immunization,”
*Physical Review E*, vol. 77, no. 3, article 036113, 2008. View at Publisher · View at Google Scholar - C. Castellano and R. Pastor-Satorras, “Thresholds for epidemic spreading in networks,”
*Physical Review Letters*, vol. 105, no. 21, Article ID 218701, 4 pages, 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Moreno, R. Pastor-Satorras, and A. Vespignani, “Epidemic outbreaks in complex heterogeneous networks,”
*European Physical Journal B*, vol. 26, no. 4, pp. 521–529, 2002. View at Publisher · View at Google Scholar · View at Scopus - L. C. Chen and K. M. Carley, “The impact of countermeasure propagation on the prevalence of computer viruses,”
*IEEE Transactions on Systems, Man, and Cybernetics B*, vol. 34, no. 2, pp. 823–833, 2004. View at Publisher · View at Google Scholar · View at Scopus - M. Draief, A. Ganesh, and L. Massoulié, “Thresholds for virus spread on networks,”
*The Annals of Applied Probability*, vol. 18, no. 2, pp. 359–378, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. R. C. Piqueira, A. A. de Vasconcelos, C. E. C. J. Gabriel, and V. O. Araujo, “Dynamic models for computer viruses,”
*Computers and Security*, vol. 27, no. 7-8, pp. 355–359, 2008. View at Publisher · View at Google Scholar · View at Scopus - J. R. C. Piqueira and V. O. Araujo, “A modified epidemiological model for computer viruses,”
*Applied Mathematics and Computation*, vol. 213, no. 2, pp. 355–360, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - J. Ren, X. Yang, L.-X. Yang, Y. Xu, and F. Yang, “A delayed computer virus propagation model and its dynamics,”
*Chaos, Solitons & Fractals*, vol. 45, no. 1, pp. 74–79, 2012. View at Publisher · View at Google Scholar - J. Ren, X. Yang, Q. Zhu, L.-X. Yang, and C. Zhang, “A novel computer virus model and its dynamics,”
*Nonlinear Analysis: Real World Applications*, vol. 13, no. 1, pp. 376–384, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - H. Yuan and G. Chen, “Network virus-epidemic model with the point-to-group information propagation,”
*Applied Mathematics and Computation*, vol. 206, no. 1, pp. 357–367, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - H. Yuan, G. Chen, J. Wu, and H. Xiong, “Towards controlling virus propagation in information systems with point-to-group information sharing,”
*Decision Support Systems*, vol. 48, no. 1, pp. 57–68, 2009. View at Publisher · View at Google Scholar · View at Scopus - T. Dong, X. Liao, and H. Li, “Stability and Hopf bifurcation in a computer virus model with multistate antivirus,”
*Abstract and Applied Analysis*, vol. 2012, Article ID 841987, 16 pages, 2012. View at Publisher · View at Google Scholar - J. R. C. Piqueira, B. F. Navarro, and L. H. A. Monteiro, “Epidemiological models applied to viruses in computer networks,”
*Journal of Computer Science*, vol. 1, no. 1, pp. 31–34, 2005. View at Google Scholar - B. K. Mishra and N. Jha, “Fixed period of temporary immunity after run of anti-malicious software on computer nodes,”
*Applied Mathematics and Computation*, vol. 190, no. 2, pp. 1207–1212, 2007. View at Publisher · View at Google Scholar · View at Scopus - X. Han and Q. Tan, “Dynamical behavior of computer virus on Internet,”
*Applied Mathematics and Computation*, vol. 217, no. 6, pp. 2520–2526, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - N. F. Britton,
*Essential Mathematical Biology*, Springer, London, UK, 2003. View at Publisher · View at Google Scholar - B. K. Mishra and D. K. Saini, “SEIRS epidemic model with delay for transmission of malicious objects in computer network,”
*Applied Mathematics and Computation*, vol. 188, no. 2, pp. 1476–1482, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - B. K. Mishra and S. K. Pandey, “Dynamic model of worms with vertical transmission in computer network,”
*Applied Mathematics and Computation*, vol. 217, no. 21, pp. 8438–8446, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - O. A. Toutonji, S.-M. Yoo, and M. Park, “Stability analysis of VEISV propagation modeling for network worm attack,”
*Applied Mathematical Modelling*, vol. 36, no. 6, pp. 2751–2761, 2012. View at Publisher · View at Google Scholar - B. K. Mishra and N. Jha, “SEIQRS model for the transmission of malicious objects in computer network,”
*Applied Mathematical Modelling*, vol. 34, no. 3, pp. 710–715, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH - L. Feng, X. Liao, H. Li, and Q. Han, “Hopf bifurcation analysis of a delayed viral infection model in computer networks,”
*Mathematical and Computer Modelling*, vol. 56, no. 7-8, pp. 167–179, 2012. View at Google Scholar - Q. Zhu, X. Yang, L.-X. Yang, and C. Zhang, “Optimal control of computer virus under a delayed model,”
*Applied Mathematics and Computation*, vol. 218, no. 23, pp. 11613–11619, 2012. View at Publisher · View at Google Scholar - C. Gan, X. Yang, W. Liu, Q. Zhu, and X. Zhang, “Propagation of computer virus under human intervention: a dynamical model,”
*Discrete Dynamics in Nature and Society*, vol. 2012, Article ID 106950, 8 pages, 2012. View at Publisher · View at Google Scholar - L.-X. Yang, X. Yang, L. Wen, and J. Liu, “A novel computer virus propagation model and its dynamics,”
*International Journal of Computer Mathematics*. In press. View at Publisher · View at Google Scholar - L.-X. Yang, X. Yang, Q. Zhu, and L. Wen, “A computer virus model with graded cure rates,”
*Nonlinear Analysis: Real World Applications*. In press. View at Publisher · View at Google Scholar - L.-X. Yang, X. Yang, L. Wen, and J. Liu, “Propagation behavior of virus codes in the situation that infected computers are connected to the Internet with positive probability,”
*Discrete Dynamics in Nature and Society*, vol. 2012, Article ID 693695, 13 pages, 2012. View at Publisher · View at Google Scholar