Coupled Kermack-McKendrick models for randomly scanning and bandwidth-saturating internet worms

George Kesidis, Ihab Hamadeh, Soranun Jiwasurat

Research output: Contribution to journalConference article

14 Citations (Scopus)

Abstract

We present a simple, deterministic mathematical model for the spread of randomly scanning and bandwidth-saturating Internet worms. Such worms include Slammer and Witty, both of which spread extremely rapidly. Our model, consisting of coupled Kermack-McKendrick equations, captures both the measured scanning activity of the worm and the network limitation of its spread, i.e., the effective scan-rate per worm/infective. We fit our model to available data for the Slammer worm and demonstrate its ability to accurately represent Slammer's total scan-rate to the core.

Original languageEnglish (US)
Pages (from-to)101-109
Number of pages9
JournalLecture Notes in Computer Science
Volume3375
StatePublished - Sep 9 2005
EventThird International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2005 - Catania, Italy
Duration: Feb 2 2005Feb 4 2005

Fingerprint

Worm
Scanning
Bandwidth
Internet
Mathematical models
Model
Deterministic Model
Mathematical Model
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{3d86e01b92664d3fa621d8c339d6e45c,
title = "Coupled Kermack-McKendrick models for randomly scanning and bandwidth-saturating internet worms",
abstract = "We present a simple, deterministic mathematical model for the spread of randomly scanning and bandwidth-saturating Internet worms. Such worms include Slammer and Witty, both of which spread extremely rapidly. Our model, consisting of coupled Kermack-McKendrick equations, captures both the measured scanning activity of the worm and the network limitation of its spread, i.e., the effective scan-rate per worm/infective. We fit our model to available data for the Slammer worm and demonstrate its ability to accurately represent Slammer's total scan-rate to the core.",
author = "George Kesidis and Ihab Hamadeh and Soranun Jiwasurat",
year = "2005",
month = "9",
day = "9",
language = "English (US)",
volume = "3375",
pages = "101--109",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Coupled Kermack-McKendrick models for randomly scanning and bandwidth-saturating internet worms. / Kesidis, George; Hamadeh, Ihab; Jiwasurat, Soranun.

In: Lecture Notes in Computer Science, Vol. 3375, 09.09.2005, p. 101-109.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Coupled Kermack-McKendrick models for randomly scanning and bandwidth-saturating internet worms

AU - Kesidis, George

AU - Hamadeh, Ihab

AU - Jiwasurat, Soranun

PY - 2005/9/9

Y1 - 2005/9/9

N2 - We present a simple, deterministic mathematical model for the spread of randomly scanning and bandwidth-saturating Internet worms. Such worms include Slammer and Witty, both of which spread extremely rapidly. Our model, consisting of coupled Kermack-McKendrick equations, captures both the measured scanning activity of the worm and the network limitation of its spread, i.e., the effective scan-rate per worm/infective. We fit our model to available data for the Slammer worm and demonstrate its ability to accurately represent Slammer's total scan-rate to the core.

AB - We present a simple, deterministic mathematical model for the spread of randomly scanning and bandwidth-saturating Internet worms. Such worms include Slammer and Witty, both of which spread extremely rapidly. Our model, consisting of coupled Kermack-McKendrick equations, captures both the measured scanning activity of the worm and the network limitation of its spread, i.e., the effective scan-rate per worm/infective. We fit our model to available data for the Slammer worm and demonstrate its ability to accurately represent Slammer's total scan-rate to the core.

UR - http://www.scopus.com/inward/record.url?scp=24144441166&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144441166&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:24144441166

VL - 3375

SP - 101

EP - 109

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -