Stochastic behavior of random constant scanning worms

Kurt R. Rohloff, Tamer Başar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper discusses modeling and simulation issues associated with the stochastic behavior of a special type of a computer worm called a Random Constant Scanning (RCS) worm. 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. Conditions are shown for when worm models can safely ignore some stochastic properties of RCS worm propagation. A computationally simple hybrid deterministic/stochastic model for the observed scanning behavior on a local network due to the global propagation of an RCS scanning worm is also presented and discussed.

Original languageEnglish (US)
Title of host publicationProceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005
Pages339-344
Number of pages6
DOIs
StatePublished - Dec 1 2005
Event14th International Conference on Computer Communications and Networks, ICCCN 2005 - San Diego, CA, United States
Duration: Oct 17 2005Oct 19 2005

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2005
ISSN (Print)1095-2055

Other

Other14th International Conference on Computer Communications and Networks, ICCCN 2005
CountryUnited States
CitySan Diego, CA
Period10/17/0510/19/05

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Stochastic behavior of random constant scanning worms'. Together they form a unique fingerprint.

Cite this