Coupled Kermack-McKendrick Models for Randomly Scanning and Bandwidth-Saturating Internet Worms
- 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
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.
Unable to display preview. Download preview PDF.