The rapid propagation of computer virus is one of the greatest threats to current cybersecurity. This work deals with the optimal control problem of virus propagation among computers and external devices. To formulate this problem, two control strategies are introduced: (a) external device blocking, which means prohibiting a fraction of connections between external devices and computers, and (b) computer reconstruction, which includes updating or reinstalling of some infected computers. Then the combination of both the impact of infection and the cost of controls is minimized. In contrast with previous works, this paper takes into account a state-based cost weight index in the objection function instead of a fixed one. By using Pontryagin’s minimum principle and a modified forward-backward difference approximation algorithm, the optimal solution of the system is investigated and numerically solved. Then numerical results show the flexibility of proposed approach compared to the regular optimal control. More numerical results are also given to evaluate the performance of our approach with respect to various weight indexes.
National Natural Science Foundation of China117471256170206661672004Chongqing Municipal Education CommissionKJ1500434China Scholarship Council201707845012Chongqing Engineering Research Center of Mobile Internet Data Application1. Introduction
Computer virus, ranging from Morris worms in 1988 to WannaCry last year, can spread to every corner of our world via Internet in a very short time. The direct and indirect economic losses due to computer virus worldwide amount to as much as several billions and even tens of billions of dollars each year [1]. So a better understanding of the behaviors of virus propagation and predicting its outbreak are of crucial importance to thwart its wide spread. In this scenario, more and more attentions from worldwide scholars have been paid to the dynamical modeling of computer virus propagation through the classical epidemiology approach.
Depending on the topology of propagation networks, all current dynamical models of computer virus fall into two categories: homogeneous models and heterogeneous models [2]. Based on the fact that some virus can infect an arbitrary vulnerable computer through random scanning, the homogeneous models regard the propagation network as fully connected, such as the 1-n-n-1 type D-SEIR malicious propagation model proposed by Mishra et al. [3], SCIR model and SEIRS model proposed by Guillén et al. [4, 5], SLAR model by Dong et al. [6], SIP model proposed by Abazari et al. [7], SVEIR model proposed by Upadhyay et al. [8], and SLBS model proposed by Yang et al. [9, 10]. Instead, the heterogeneous model assumes that the virus could only spread between the direct topological neighbors. The dynamical behaviors of virus spreading over a reduced scale-free network are studied by L.-X. Yang and X. Yang [11] and Keshri et al. [12], respectively. By separating the susceptible compartment into two subcompartments, a heterogeneous WSI model is established and analyzed by Liu et al. [13]. In [14], both the topology of networks and the interaction between computer viruses and honeynet potency are considered. Both homogeneous and heterogeneous models provide significant insights into a detailed and qualitative understanding of how and when computer viruses break out.
The main purpose of modeling virus propagation dynamics is to develop appropriate strategies to suppress its diffusion. One of the most common control strategies is the application of optimal control in virus propagation model. From the perspective of economy, optimal control is used to seek a reasonable tradeoff between cost and benefit. In this context, it has been widely used in the control application of biological viruses [15–19], rumors [20, 21], and others [22, 23]. Inspired by these, Zhu et al. proposed a delayed SIR model for computer virus propagation [24]. Then optimal control strategy is applied to other computer virus models such as the SLBS model [25] and its delayed form [26], the SIR model [27], and the SICS model on scale-free network [28].
In this paper, we aim to develop some effective strategies to control the virus propagation among computers and external devices using an optimal control approach. To achieve this, a classical model depicting the virus interactive dynamical behaviors between computers and external devices is adopted to formulate the optimal control problem [29]. Moreover, we note that most of current works assume that the weight indexes in their objective function are constant. In fact, the costs of some control strategies will change with the number of infected computers, because the required resources for the control will undoubtedly increase as more computers get infected. So, motivated by this fact and some related work in epidemiology [30], in this paper, we consider a state-based cost weight index in the objection function instead of a fixed one and solve this problem by using Pontryagin’s minimum principle and a numerical algorithm, respectively.
The rest of this paper is organized as follows. By using Pontryagin’s minimum principle, the optimal control problem is formulated and analyzed in Section 2. In Section 3, the numerical algorithm for the optimal system is given at first. Based on this algorithm, various examples are performed to evaluate the effectiveness of the proposed approach. Finally, this work is outlined in Section 4.
2. Formulation and Analysis of the Problem
In this paper, we take a classic computer virus propagation model [29], which incorporates the interactions between computers and external removable devices, to set our optimal control problem. In the model, all computers are split into the following three classes: susceptible computers (S), infected computers (I), and recovered computers (R), whereas all removable devices are divided into two compartments: susceptible devices (DS) and infected devices (DI). Under some reasonable assumptions (see [29]), one can derive the following computer virus propagation model:(1)S˙=λ1-β1SI-β2SDIDN-μ1S,I˙=β1SI+β2SDIDN-μ1+σ1I,R˙=σ1I-μ1R,D˙S=λ2-β2DSIN+σ2DIRN-μ2DS,D˙I=β2DSIN-σ2DIRN-μ2DI. And the definitions of notations and parameters are shown in “Definitions of Notations and Parameters in System (1)”.
To formulate the optimal control problem of system (1), we introduce two types of countermeasures for inhibiting virus propagation: (a) external device blocking, which means prohibiting a fraction of connections between external devices and computers, and (b) computer reconstruction, which includes updating or reinstalling of some infected computers. Let u1(t) and u2(t) denote the control strengths of these two control strategies, respectively. And u1 and u2 are in the following two admissible control sets, respectively:(2)u1∈U1≜u:u is Lebesgue integrable,0⩽u⩽Δ1,∀t∈0,tf,u2∈U2≜u:u is Lebesgue integrable,0⩽u⩽Δ2,∀t∈0,tf, where Δ1, Δ2, and tf are positive constants. More specifically, Δ1 and Δ2 are the minimum allowed control strengths of u1 and u2, respectively. It is practical to set u1 and u2 to be bounded. For u1, it is unrealistic to quarantine all external devices from computers. For u2, the control strength is limited by resource capacity of computer reconstruction.
Then, by incorporating the above control variables, the state system corresponding to system (1) can be written as(3)S˙=λ1-β1SI-1-u1β2SDIDN-μ1S+u2I,I˙=β1SI+1-u1β2SDIDN-μ1+σ1I-u2I,R˙=σ1I-μ1R,D˙S=λ2-1-u1β2DSIN+1-u1σ2DIRN-μ2DS,D˙I=1-u1β2DSIN-1-u1σ2DIRN-μ2DI. Compared to system (1), the infection of computers caused by the infective external devices is reduced to (1-u1)β2S(DI/DN) in system (3) due to the introduction of u1. Meanwhile, the recovered force of infective devices also decreases to (1-u1)σ2DI(R/N). And here u2 denotes the fraction of reinstalled computers. Hence, on average, u2I is the number of computers whose state changes to susceptible class from infected class per unit time.
Assume further that the control strategies will be applied if and only if the number of infected computers is above a threshold. Denote the threshold as Im, where Im⩾0. To minimize the number of infected computers and external devices while keeping the cost of control as low as possible, we consider an optimal control problem to minimize the following objective function:(4)Ju1,u2,t0,tf=∫t0tfg1v,t+g2u1,u2,v,tdt, where v is the solution of state system (1) computed at u1 and u2. Here g1(v,t) and g2(u1,u2,v,t) denote the infection index and the cost index, respectively. Furthermore, let w1 and w2 be the relative weights of computer and device infection, respectively, where w1,w2>0. Then we have (5)g1v,t=w1I+w2DI. Considering the fact that the cost of the first strategy is independent of the infection individuals whereas the second is dependent on the number of infective computers I, we set the cost index g2(u1,u2,v,t) in the following form: (6)g2u1,u2,v,t=1κ1p1u1κ1+1κ2p2Iu2κ2, where both the positive constants κ1 and κ2 are set to be 2 in this paper, the positive constant p1 is the relative cost weight associated with the control measure u1, and p2(I) depending on I is the relative cost weight associated with the control measure u2. For our purpose, we divide the interval [Im,+∞) into Z subintervals [Ii,Ii+1), i=1,2,…,Z, I1=Im, and IZ+1=+∞. Then the cost weight p2(I) can be set as (7)p2I=αi,if I∈Ii,Ii+1, where αi>0,i=1,2,…,Z. Considering the saturation effect that more cost should be paid to get the same result as the number of infected computers increases, we have α1<α2<⋯<αZ and the length of subintervals I2-I1<I3-I2<⋯<IZ+1-IZ.
Here, for given t0 and tf, we have the following two cases.
Case 1 (I(t0)≥Im).
In this case, we find a nonnegative integer j (j≤Z) such that I(t0)∈[Ij,Ij+1) always holds for t∈[t0,t1), and t1≤tf. Then one can obtain the following sub-objective-function:(8)Jk=∫tktk+1w1I+w2DI+12p1u12+12αju22dt,for k=0.
Case 2 (I(t0)<Im).
For this case, there is nothing to do until I(t1)≥Im holds for some time t1. Then go back to Case 1 to seek the optimal control for the minimum Jk for k=1.
In this way, the interval [t0,tf] has been divided into multiple subintervals [tk,tk+1). And I(tk) plays a role as a switch, determining whether the control should be applied. By iterating the above procedure until tk+1=tf holds for some k, the optimal solution of state system (3) for [t0,tf] can be obtained by composing the optimal solutions for all subintervals [tk,tk+1), where I(tk)≥Im.
To solve the optimal problem for a subinterval [tk,tk+1), where I(tk)≥Im, let ηi for i=1,2,…,5 denote the adjoint variables, let u1∗(t) and u2∗(t) denote the optimal control, let S∗, I∗, R∗, DS∗, DI∗, and ηi∗ for i=1,2,…,5 denote the state and adjoint variables evaluated at u1∗(t) and u2∗(t). For applying Pontryagin’s minimum principle, one can obtain the following Hamiltonian function:(9)H=w1I+w2DI+12p1u12+12αju22+η1λ1-β1SI-1-u1β2SDIDN-μ1S+u2I+η2β1SI+1-u1β2SDIDN-μ1+σ1I-u2I+η3σ1I-μ1R+η4λ2-1-u1β2DSIN+1-u1σ2DIRN-μ2DS+η51-u1β2DSIN-1-u1σ2DIRN-μ2DI. Then the adjoint system can be obtained as (10)η˙1∗=-∂H∂SS=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=β1I∗+1-u1∗β2DI∗DN∗η1∗-η2∗+μ1η1∗+1-u1∗β2DS∗I∗N∗2-σ2DI∗R∗N∗2η5∗-η4∗,η˙2∗=-∂H∂IS=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=-w1+β1S∗-u2∗η1∗-η2∗+μ1+σ1η2∗-σ1η3∗+1-u1∗β2DS∗S∗+R∗N∗2+σ2DI∗R∗N∗2η4∗-η5∗,η˙3∗=-∂H∂RS=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=μ1η3∗+1-u1∗β2DS∗I∗N∗2+σ2DI∗S∗+I∗N∗2η5∗-η4∗,η˙4∗=-∂H∂RSS=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=1-u1∗β2S∗DI∗DN∗2η2∗-η1∗+μ2η4∗+1-u1∗β2I∗N∗η4∗-η5∗,η˙5∗=-∂H∂RIS=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=-w2+1-u1∗β2S∗DS∗DN∗2η1∗-η2∗+1-u1∗σ2R∗N∗η5∗-η4∗+μ2η5∗.
By the optimal conditions, we have (11)∂H∂u1S=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=p1u1∗+η1-η2β2S∗DI∗DN∗+η4-η5β2DS∗I∗N∗-σ2DI∗R∗N∗=0,∂H∂u2S=S∗,I=I∗,R=R∗,DS=DS∗,DI=DI∗,u1,2=u1,2∗,ηi=ηi∗=αju2∗+η1-η2I∗=0, which implies that (12)u1∗=max0,minΔ1,η2-η1β2S∗DI∗p1DN∗+η5-η4p1N∗β2DS∗I∗-σ2DI∗R∗,u2∗=max0,minΔ2,η2-η1I∗αj. Therefore, by combining state system (3), the adjoint system, and the optimal conditions, we have derived the following optimality system:(13)S∗˙=λ1-β1S∗I∗-1-u1∗β2S∗DI∗DN∗-μ1S∗+u2∗I∗,I∗˙=β1S∗I∗+1-u1∗β2SDI∗DN∗-μ1+σ1I∗-u2∗I∗,R∗˙=σ1I∗-μ1R∗,DS∗˙=λ2-1-u1∗β2DS∗I∗N∗+1-u1∗σ2DI∗R∗N∗-μ2DS∗,DI∗˙=1-u1∗β2DS∗I∗N∗-1-u1∗σ2DI∗R∗N∗-μ2DI∗,η˙1∗=β1I∗+1-u1∗β2DI∗DN∗η1∗-η2∗+μ1η1∗+1-u1∗β2DS∗I∗N∗2-σ2DI∗R∗N∗2η5∗-η4∗,η˙2∗=-w1+β1S∗-u2∗η1∗-η2∗+μ1+σ1η2∗-σ1η3∗+1-u1∗β2DS∗S∗+R∗N∗2+σ2DI∗R∗N∗2η4∗-η5∗,η˙3∗=μ1η3∗+1-u1∗β2DS∗I∗N∗2+σ2DI∗S∗+I∗N∗2η5∗-η4∗,η˙4∗=1-u1∗β2S∗DI∗DN∗2η2∗-η1∗+μ2η4∗+1-u1∗β2I∗N∗η4∗-η5∗,η˙5∗=-w2+1-u1∗β2S∗DS∗DN∗2η1∗-η2∗+1-u1∗σ2R∗N∗η5∗-η4∗+μ2η5∗,u1∗=0if I∗tk<Imaif I∗tk≥Im,u2∗=0if I∗tk<Immax0,minΔ2,η2-η1I∗αjif I∗tk≥Imwith transversality conditions (14)ηi∗tk+1=0for i=1,2,…,5 if I∗tk≥Im,where(15)a=max0,minΔ1,η2-η1β2S∗DI∗p1DN∗+η5-η4p1N∗β2DS∗I∗-σ2DI∗R∗.
3. Numerical Results and Discussion
In this section, some numerical results of the proposed optimal control strategies are evaluated. By using a modified forward and backward difference approximation algorithm shown in Algorithm 1, the optimality system can be solved numerically. For the sake of simplicity, the final number of all removable devices is normalized to unity, whereas the final number of all computers is normalized to ten as the assumption in [29]. For our purpose, some parameter values of the system used in the simulations are fixed in Table 1. And the initial conditions of the state system at t0 are chosen as S(0)=5, I(0)=1, R(0)=0, RS(0)=0.5, and RI(0)=0.1. In the first subsection, the performance of proposed optimal control strategies is evaluated by comparison with both regular optimal control and no control. And the effect of objective function weight indexes is evaluated in the second subsection.
Parameter values used in the simulation.
Parameter
λ1
λ2
β1
β2
σ1
σ2
μ1
μ2
Δ1
Δ2
Values
1
0.1
0.035
0.1
0.02
0.005
0.1
0.1
0.1
0.1
Algorithm 1: Algorithm of the optimal control.
Input: S(t0), I(t0), R(t0), DS(t0), DI(t0), w1, w2, p1, ϵ, L, αi and Ii
Output: u1∗ and u2∗
Divide the [t0,tf] into M subintervals [tk,tk+1) for k=0,1,…,M-1.
fork=0toM-1do
u1∗,u2∗←0, ∀t∈[tk,tk+1)
ifI(tk)<I1
break
else
forj=1toZdo% find index j of αj for [tk,tk+1)
ifIj≤I(tk)andIj+1≥I(tk)
index←j
break
end if
end for
ηi(tk+1)←0 for i=1,2,…,5
loop←0
do
u~1←u1∗, u~2←u2∗
loop←loop+1
Calculate S∗, I∗, R∗, DS∗, DI∗ with u~1 and u~2 % forward
Calculate ηi∗ with ηi(tk+1)=0 for i=1,2,…,5 % backward
Calculate u1∗, u2∗ with αindex
until(u1∗-u~1)2+(u2∗-u~2)2<ϵorloop>L
% ϵ is a given sufficiently small positive constant
% L is the maximum number of iterations
end if
end for
3.1. Performance of Proposed Optimal Control
According to the problem formulation in Section 2, a simple form of piecewise weight index p2(I) is considered as follows:(16)p2I=α1=3000forI∈y1,y2=2,4,α2=5000for I∈y2,+∞=4,+∞.That is, no action is required in the slight infection phase with the infection number of computers less than the control threshold. Here the control threshold is set to be 2 (i.e., 20% in proportion). With the increase of the infected computers I, a more serious phase is reached, and the optimal control is employed with p2(I)=3000. When I is greater or equal to 4 (i.e., 40% in proportion), the most serious phase is reached; the optimal control is employed with p2(I)=5000. Moreover, other weight indexes are chosen as w1=10, w2=5, and p1=500, and the control period is set as t0=0 and tf=60.
In Figure 1, the evolution of both the optimal control and the infective proportion of computers is depicted. Obviously, the shape of the control signal u2 is divided into 3 segments by switching based on the infection proportion of computers, which is defined in (16). And the shape of the control signal u1 is divided into 2 segments as the device blocking control strategy is deployed with constant weight index if I exceeds the control threshold. Correspondingly, the controlled evolution of infective proportion of computers is split into 3 segments by 2 inflection points: the first segment performs exactly the same as the one without control, whereas the following two segments significantly lie below the one without control.
Optimal control with respect to I in proportion.
In order to examine the performance of proposed state-based switching control with respect to the regular optimal control, two solutions of regular optimal control with constant cost weight indexes p2=3000 and p2=5000 are considered, respectively, in Figures 2–5, while maintaining all other parameters the same as Figure 1.
Comparison of I in proportion with different control approaches.
Comparison of DI in proportion with different control approaches.
Comparison of u1 with different control approaches.
Comparison of u2 with different control approaches.
Obviously, a lower cost weight index implies a heavier strength control force, which leads to a lower infective proportion. Hence, as shown in Figures 2 and 3, the infective proportions of both computers and devices with p2=3000 always lie below the ones with p5=3000. The evolution shapes of both computers and devices infective proportion with switching control are located above the other two shapes, respectively, in the initial period of time, because the control is not deployed when the infection proportion is small. Then, in the middle period of time, the evolution curve of the proportion of infected computers with switching control lies between the other two curves with p2=3000 and p2=5000. Similar observation for the evolution of the proportion of infected devices can be made in Figure 3. Instead, in the final period of time, the evolution seems to act the same as the one with p5=3000 due to the same weight index used in these two cases. The similar characteristics of evolution behaviors of both u1 and u2 can be observed from Figures 4 and 5.
In reality, when performing the same control force, more cost should be paid with the increase of the number of infection computers. So in the application of optimal control it is reasonable to assume that the cost weight index needs to be adjusted dynamically along with the evolution of infection nodes. The proposed optimal control approach provides a flexible solution to this kind of situation: the control is required if and only if the one infected is above the control threshold and a lower cost weight index should be applied with the further increase of infection. Also note that by setting I0=0 and I1=+∞ the proposed approach can be translated into the regular one. As a result, the proposed control strategies perform more reasonably and flexibly than regular optimal control with constant cost weight index.
3.2. Performance of Different Groups of Weight Indexes
In this subsection, 8 groups of numerical experiments are carried out to show the impacts of weight indexes on the solution of optimal control. The parameter values used here can be found in Table 1, and the weight indexes are shown in Table 2, where p2 is of the same form as (16). All experimental results are shown in Figures 6–9. Then the following visually results can be obtained:
Combinations of different weight indexes.
Index
Cases
#1
#2
#3
#4
#5
#6
#7
#8
w1
10
10
10
10
20
20
20
20
w2
5
5
5
5
10
10
10
10
p1
500
500
1000
1000
500
500
1000
1000
p2
α1
3000
4000
3000
4000
3000
4000
3000
4000
α2
4000
5000
4000
5000
4000
5000
4000
5000
Comparison of I in proportion with different groups of weight indexes.
Comparison of DI in proportion with different groups of weight indexes.
Comparison of u1 in proportion with different groups of weight indexes.
Comparison of u2 in proportion with different groups of weight indexes.
(1) The change of cost weight index p1 has little effect upon the infection reduction, as the shapes of #1, #2, #5, and #6 are, respectively, close to shapes of #3, #4, #7, and #8 shown in Figures 6 and 7.
(2) Both the increase of index p2 and the decrease of w1 and w2 have a remarkable effect on obtaining lower infection solution.
(3) As shown in Figures 8 and 9, higher indexes p1 and p2 mean that weaker optimal controls of u1 and u2 will be applied, respectively.
Moreover, to further show the flexibility of the proposed approach, comparison experiments of various forms of p2 are carried out as shown in Figures 10 and 11. Here, the forms of p2 are chosen as follows, and other weight indexes are chosen as w1=10, w2=5, and p1=500:(17)p21I=α1=3000for I∈y1,y2=2,3,α2=3500for I∈y2,+∞=3,+∞,p22I=α1=3000for I∈y1,y2=2,3,α2=3500for I∈y2,y3=3,4,α3=4000for I∈y3,+∞=4,+∞,p23I=α1=3000for I∈y1,y2=2,3,α2=3500for I∈y2,y3=3,4,α3=4000for I∈y3,y4=4,5,α4=5000for I∈y5,+∞=5,+∞.
Comparison of I in proportion with different forms of p2.
Comparison of u2 with different forms of p2.
3.3. Further Discussion
From the above experiments, we can conclude that (1) the proposed state-based optimal control approach can be applied to contain the spread of virus among computers and external devices; (2) the approach also performs more reasonably and flexibly compared to the conventional optimal control with constant coast weight index. We also note that the original model considered in this paper regards the propagation network as fully connected. However, as mentioned in Introduction, there are an increasing number of heterogeneous models that incorporate the impact of topology. Considering the similarity of applications of optimal control in heterogeneous models [31, 32], we can conclude that our proposed approach is also suitable for these models. In addition, this approach may provide some insights for other related fields such as rumor propagation [33] and marketing [34].
Although the efficiency of the proposed model has been verified by simulation, several issues still need to be settled when it is applied in reality. The first issue is how to determine the precise value of Im. It may be a good way to obtain it from extensive simulation experiments.
4. Conclusion
In this work, we have formulated an optimal control problem to minimize the tradeoff between spread of virus and costs of control. Instead of a fixed cost weight index used in previous work, we adopted an infection state-based index. By using Pontryagin’s minimum principle, the optimal control problem is analyzed. We also develop a modified forward-backward algorithm to calculate the optimal solution numerically. Finally, the flexibility and effectiveness of our proposed approach are verified by simulations. We will also consider exploring the ideas in strategic networks, with different topologies, and consider how to practically apply the ideas here.
Definitions of Notations and Parameters in System (1)λ1:
The rate at which computers are connected to network
λ2:
The recruitment of external devices
β1:
The contact infective force between susceptible and infected computers
β2:
The contact infective force between computers and external devices
σ1:
The recovery rates of infective computers
σ2:
The recovery rates of external devices
μ1:
The rate at which networked computers are disconnected from network
μ2:
The rate at which removable devices break down
S:
Short for S(t), the number of susceptible computers at time t
I:
Short for I(t), the number of infected computers at time t
R:
Short for R(t), the number of recovered computers at time t
N:
Short for N(t), the total number of computers at time t, i.e., N≡S+I+R
DS:
Short for DS(t), the number of susceptible external devices at time t
DI:
Short for DI(t), the number of infective external devices at time t
DN:
Short for DN(t), the total number of external devices at time t, i.e., DN≡DS+DI.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Acknowledgments
This work is supported by the National Natural Science Foundation of China (nos. 11747125, 61702066, and 61672004), Scientific and Technological Research Program of Chongqing Municipal Education Commission (no. KJ1500434), the Foundation from China Scholarship Council (201707845012), and Chongqing Engineering Research Center of Mobile Internet Data Application.
WangY.WenS.XiangY.ZhouW.Modeling the propagation of worms in networks: a survey201416294296010.1109/surv.2013.100913.001952-s2.0-84901195399ZhuQ.CenC.A novel computer virus propagation model under security classification2017201711860908210.1155/2017/8609082MR3659513MishraB. K.HaldarK.SinhaD. N.Impact of information based classification on network epidemics201662828910.1038/srep28289GuillénJ. D. H.del ReyA. M.EncinasL. H.Study of the stability of a SEIRS model for computer worm propagation201747941142110.1016/j.physa.2017.03.023MR3631795GuillénJ. D.del ReyA. M.Modeling malware propagation using a carrier compartment20185621722610.1016/j.cnsns.2017.08.011MR3709824DongT.WangA.LiaoX.Impact of discontinuous antivirus strategy in a computer virus model with the point to group20164043400340910.1016/j.apm.2015.10.029MR34545342-s2.0-84959357926AbazariF.AnalouiM.TakabiH.Effect of anti-malware software on infectious nodes in cloud environment2016581391482-s2.0-8495755964810.1016/j.cose.2015.12.002UpadhyayR. K.KumariS.MisraA. K.Modeling the virus dynamics in computer network with SVEIR model and nonlinear incident rate2017541-248550910.1007/s12190-016-1020-0MR3647188YangL.-X.YangX.WenL.LiuJ.A novel computer virus propagation model and its dynamics201289172307231410.1080/00207160.2012.715388MR29998082-s2.0-84867851680YangL.-X.YangX.ZhuQ.WenL.A computer virus model with graded cure rates201314141442210.1016/j.nonrwa.2012.07.005MR2969844Zbl1258.680202-s2.0-84866383289YangL.-X.YangX.The spread of computer viruses over a reduced scale-free network201439617318410.1016/j.physa.2013.11.026MR31416792-s2.0-84890549801KeshriN.GuptaA.MishraB. K.Impact of reduced scale free network on wireless sensor network201646323624510.1016/j.physa.2016.07.059MR35410472-s2.0-84980034334LiuW.LiuC.LiuX.CuiS.HuangX.Modeling the spread of malware with the influence of heterogeneous immunization20164043141315210.1016/j.apm.2015.09.105MR34545162-s2.0-84956808730RenJ.XuY.A compartmental model to explore the interplay between virus epidemics and honeynet potency201859869910.1016/j.apm.2018.01.019MR3788571SharmaS.MondalA.PalA. K.SamantaG. P.Stability analysis and optimal control of avian influenza virus A with time delays201711610.1007/s40435-017-0379-6MoualeuD. P.WeiserM.EhrigR.DeuflhardP.Optimal control for a tuberculosis model with undetected cases in Cameroon2015203986100310.1016/j.cnsns.2014.06.037MR32556492-s2.0-84975832691OkosunK. O.MakindeO. D.Optimal control analysis of hepatitis C virus with acute and chronic stages in the presence of treatment and infected immigrants201472123145001910.1142/S1793524514500193MR3189687RodriguesH. S.MonteiroM. T.TorresD. F.Vaccination models and optimal control strategies to dengue201424711210.1016/j.mbs.2013.10.006MR31489102-s2.0-84892390417MojaverA.KheiriH.Dynamical analysis of a class of hepatitis C virus infection models with application of optimal control201693123165003810.1142/S1793524516500388MR3463829KandhwayK.KuriJ.Optimal control of information epidemics modeled as Maki Thompson rumors20141912413541472-s2.0-8490193152810.1016/j.cnsns.2014.04.022HuoL.LinT.FanC.LiuC.ZhaoJ.Optimal control of a rumor propagation model with latent period in emergency event201554110.1186/s13662-015-0394-x2-s2.0-84923848762KandhwayK.KuriJ.How to run a campaign: optimal control of SIS and SIR information epidemics2014231799210.1016/j.amc.2013.12.164MR3174013ChenP.-Y.ChengS.-M.ChenK.-G.Optimal control of epidemic information dissemination over networks20144412231623282-s2.0-8491186873010.1109/TCYB.2014.2306781ZhuQ.YangX.YangL.-X.ZhangC.Optimal control of computer virus under a delayed model201221823116131161910.1016/j.amc.2012.04.092MR2944005Zbl1278.490452-s2.0-84863325044ZhangC.HuangH.Optimal control strategy for a novel computer virus propagation model on scale-free networks201645125126510.1016/j.physa.2016.01.028MR34718772-s2.0-84958740152ChenL.HattafK.SunJ.Optimal control of a delayed SLBS computer virus model201542724425010.1016/j.physa.2015.02.048MR3318705ZhuL. H.ZhaoH. Y.Dynamical analysis and optimal control for a malware propagation model in an information network20151491370138610.1016/j.neucom.2014.08.0602-s2.0-84912099690ZhangX.GanC.Global attractivity and optimal dynamic countermeasure of a virus propagation model in complex networks20184901004101810.1016/j.physa.2017.08.085MR37164252-s2.0-85029538953ZhuQ.YangX.RenJ.Modeling and analysis of the spread of computer virus201217125117512410.1016/j.cnsns.2012.05.030MR29603032-s2.0-84864413758Di GiamberardinoP.IacovielloD.Optimal control of SIR epidemic model with state dependent switching cost index20173137738010.1016/j.bspc.2016.09.011ZhangT.YangL.-X.YangX.WuY.TangY. Y.Dynamic malware containment under an epidemic model with alert201747024926010.1016/j.physa.2016.11.143MR35901062-s2.0-85006795661YangL.-X.DraiefM.YangX.The optimal dynamic immunization under a controlled heterogeneous node-based SIRS model201645040341510.1016/j.physa.2016.01.026MR3463366PanC.YangL.-X.YangX.WuY.TangY. Y.An effective rumor-containing strategy2018500809110.1016/j.physa.2018.02.025MR3777358LiP.YangX.YangL.-X.XiongQ.WuY.TangY. Y.The modeling and analysis of the word-of-mouth marketing201849311610.1016/j.physa.2017.10.050MR37397082-s2.0-85033443804