Modeling the spread of virus in packets on scale free network

In this paper, we propose a new model for computer virus attacks and recovery at the level of information packets. The model we propose is based on one hand on the susceptible-infected (SI) and susceptible-infected-recovered (SIR) stochastic epidemic models for computer virus propagation and on the other hand on the time-discrete Markov chain of the minimal traffic routing protocol. We have applied this model to the scale free Barabasi–Albert network to determine how the dynamics of virus propagation is affected by the traffic flow in both the free-flow and the congested phases. The numerical results show essentially that the proportion of infected and recovered packets increases when the rate of infection λ and the recovery rate β increase in the free-flow phase while in the congested phase, the number of infected (recovered) packets presents a maximum (minimum) at certain critical value of β characterizing a certain competition between the infection and the recovery rates.

[1]  J. Amador.  The stochastic SIRA model for computer viruses , 2014, Appl. Math. Comput..

[2]  Hamid Ez-Zahraouy,et al.  An adaptive routing scheme in scale-free networks , 2015 .

[3]  Guanrong Chen,et al.  Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  William M. Spears,et al.  A unified prediction of computer virus spread in connected networks , 2002 .

[5]  José Roberto Castilho Piqueira,et al.  Dynamic models for computer viruses , 2008, Comput. Secur..

[6]  Xie Han,et al.  Dynamical behavior of computer virus on Internet , 2010, Appl. Math. Comput..

[7]  Chenquan Gan,et al.  Propagation of computer virus both across the Internet and external computers: A complex-network approach , 2014, Commun. Nonlinear Sci. Numer. Simul..

[8]  Lu-Xing Yang,et al.  A novel computer virus model and its dynamics , 2012 .

[9]  Chenquan Gan,et al.  Epidemics of computer viruses: A complex-network approach , 2013, Appl. Math. Comput..

[10]  A. Benyoussef,et al.  Pair-dependent rejection rate and its impact on traffic flow in a scale-free network , 2014 .

[11]  Yong Yu,et al.  Optimal routing on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  A. Benyoussef,et al.  LATTICE THREE-SPECIES MODELS OF THE SPATIAL SPREAD OF RABIES AMONG FOXES , 1999, adap-org/9904005.

[13]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[14]  Ginestra Bianconi,et al.  Congestion phenomena on complex networks , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Carey Nachenberg,et al.  Computer virus-antivirus coevolution , 1997, Commun. ACM.

[16]  Claudio Castellano,et al.  Thresholds for epidemic spreading in networks , 2010, Physical review letters.

[17]  Fred Cohen,et al.  Computer viruses—theory and experiments , 1990 .

[18]  L. Fortuna,et al.  Traffic optimization in transport networks based on local routing , 2009, 0901.1078.

[19]  Jesús Gómez-Gardeñes,et al.  Local Empathy provides Global Minimization of Congestion in Communication Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Harold W. Thimbleby,et al.  A Framework for Modelling Trojans and Computer Virus Infection , 1998, Comput. J..

[21]  Alessandro Vespignani,et al.  Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. , 2003, Physical review letters.

[22]  Laurent Massoulié,et al.  Thresholds for virus spread on networks , 2008 .

[23]  Jari Saramäki,et al.  Small But Slow World: How Network Topology and Burstiness Slow Down Spreading , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.