首页> 外文期刊>ACM Transactions on Modeling and Computer Simulation >A Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links
【24h】

A Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links

机译:使访问链接饱和的随机扫描Internet蠕虫的传播模型

获取原文
获取原文并翻译 | 示例

摘要

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 (a.k.a. stratified susceptibles-infectives (SI)) equations, captures both the measured scanning activity of the worm and the network limitation of its spread, that is, the effective scan-rate per worm/infective. The Internet is modeled as an ideal core network to which each peripheral (e.g., enterprise) network is connected via a single access link. It is further assumed in this note that as soon as a single end-system in the peripheral network is infected by the worm, the subsequent scanning of the rest of the Internet saturates the access link, that is, there is "instant" saturation. We fit our model to available data for the Slammer worm and demonstrate the model's ability to accurately represent Slammer's total scan-rate to the core.
机译:我们为随机扫描和带宽饱和的Internet蠕虫的传播提供了一种简单的确定性数学模型。此类蠕虫包括Slammer和Witty,它们的传播速度都非常快。我们的模型由耦合的Kermack-McKendrick(又名分层易感性-感染性(SI))方程组成,它捕获了测得的蠕虫扫描活动及其传播的网络限制,即每个蠕虫/感染性病毒的有效扫描率。互联网被建模为理想的核心网络,每个外围(例如,企业)网络通过单个访问链路连接到该核心网络。在此注释中进一步假定,一旦外围网络中的单个终端系统被蠕虫感染,随后对Internet其余部分的后续扫描就会使访问链接饱和,即存在“即时”饱和。我们将模型适合Slammer蠕虫的可用数据,并演示了该模型能够准确地表示Slammer核心的总扫描率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号