Coupled Kermack-McKendrick Models for Randomly Scanning and Bandwidth-Saturating Internet Worms

  • George Kesidis
  • Ihab Hamadeh
  • Soranun Jiwasurat
Conference paper

DOI: 10.1007/978-3-540-30573-6_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3375)
Cite this paper as:
Kesidis G., Hamadeh I., Jiwasurat S. (2005) Coupled Kermack-McKendrick Models for Randomly Scanning and Bandwidth-Saturating Internet Worms. In: Ajmone Marsan M., Bianchi G., Listanti M., Meo M. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2004. Lecture Notes in Computer Science, vol 3375. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • George Kesidis
    • 1
  • Ihab Hamadeh
    • 2
  • Soranun Jiwasurat
    • 2
  1. 1.Department of Electrical Engineering, Department of Computer Science and EngineeringPennsylvania State UniversityUniversity ParkUSA
  2. 2.Department of Computer Science and EngineeringPennsylvania State UniversityUniversity ParkUSA

Personalised recommendations