Deterministic and Stochastic Models for the Detection of Random Constant Scanning Worms

This paper discusses modeling and detection properties associated with the stochastic behavior of Random Constant Scanning (RCS) worms. Although these worms propagate by randomly scanning network addresses to find hosts that are susceptible to infection, traditional RCS worm models are fundamentally deterministic. A density-dependent Markov jump process model for RCS worms is presented and analyzed herein. Conditions are shown for when some stochastic properties of RCS worm propagation can be ignored and when deterministic RCS worm models can be used. A computationally simple hybrid deterministic/stochastic point-process model for locally observed scanning behavior due to the global propagation of RCS scanning worm epidemics is presented.

Provided by: Association for Computing Machinery Topic: Security Date Added: Jan 2011 Format: PDF

Find By Topic