Predicting Spread Probability of Learning‐Effect Computer Virus
Open Access
- 1 January 2021
- journal article
- research article
- Published by Wiley in Complexity
- Vol. 2021 (1)
Abstract
With the rapid development of network technology, computer viruses have developed at a fast pace. The threat of computer viruses persists because of the constant demand for computers and networks. When a computer virus infects a facility, the virus seeks to invade other facilities in the network by exploiting the convenience of the network protocol and the high connectivity of the network. Hence, there is an increasing need for accurate calculation of the probability of computer‐virus‐infected areas for developing corresponding strategies, for example, based on the possible virus‐infected areas, to interrupt the relevant connections between the uninfected and infected computers in time. The spread of the computer virus forms a scale‐free network whose node degree follows the power rule. A novel algorithm based on the binary‐addition tree algorithm (BAT) is proposed to effectively predict the spread of computer viruses. The proposed BAT utilizes the probability derived from PageRank from the scale‐free network together with the consideration of state vectors with both the temporal and learning effects. The performance of the proposed algorithm was verified via numerous experiments.Keywords
Funding Information
- Ministry of Science and Technology of the People's Republic of China (102-2221-E-007-086-MY3, 104-2221-E-007-061-MY3)
This publication has 44 references indexed in Scilit:
- A propagation model of computer virus with nonlinear vaccination probabilityCommunications in Nonlinear Science and Numerical Simulation, 2014
- Performance analysis of cellular automata Monte Carlo Simulation for estimating network reliabilityExpert Systems with Applications, 2010
- Infection functions for virus propagation in computer networks: An empirical studyTsinghua Science and Technology, 2009
- A simple universal generating function method for estimating the reliability of general multi-state node networksIIE Transactions, 2008
- A simple algorithm to search for all MCs in networksEuropean Journal of Operational Research, 2006
- Reliable identification of bounded-length viruses is NP-completeIEEE Transactions on Information Theory, 2003
- Search for MC in modified networksComputers & Operations Research, 2001
- A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problemComputers & Operations Research, 1999
- Computer Viruses as Artificial LifeArtificial Life, 1994
- ID-based authentication system for computer virus detectionElectronics Letters, 1990