|
Published Articles >> Table of Contents >> Abstract
2005 International Conference on Dependable Systems and Networks (DSN'05)
pp. 528-537
Modeling and Automated Containment of Worms
Sarah Sellke, Purdue University
Ness B. Shroff, Purdue University
Saurabh Bagchi, Purdue University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2005.66
Send link to a friend
| Abstract |
|
Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their enormous adverse impact on the Internet. There is a great interest in the research community in modeling the spread of worms and in providing adequate defense mechanisms against them. In this paper, we present a (stochastic) branching process model for characterizing the propagation of Internet worms. This model leads to the development of an automatic worm containment strategy that prevents the spread of worms beyond its early stages. Specifically, using the branching process model, we are able to (1) provide a precise condition that determines whether the worm will eventually die out and (2) provdide the probability that the total number of hosts that the worm infects will be below a certain level. We use these insights to develop a simple automatic worm containment scheme, which is demonstrated, through simulations and real trace data, to be both effective and non-intrusive.
|
 Additional Information
|
Index Terms- Internet scanning worms, stochastic worm modeling, branching process model, early phase propagation, automatic worm containment
Citation:
Sarah Sellke, Ness B. Shroff, Saurabh Bagchi,
"Modeling and Automated Containment of Worms,"
dsn,
pp. 528-537,
2005 International Conference on Dependable Systems and Networks (DSN'05),
2005
|
|
