首页> 外文会议>Canadian Conference on Electrical and Computer Engineering >Scomf and SComI botnet models: The cases of initial unhindered botnet expansion
【24h】

Scomf and SComI botnet models: The cases of initial unhindered botnet expansion

机译:Scomf和Scomi Botnet模型:初始无阻尼僵尸网络扩展的情况

获取原文

摘要

Botnets have become platforms to launch distributed denial-of-service attacks and coordinate massive e-mail spam campaigns, to name just a few of botnet-related nefarious activities. Apart from the wired networks, the increasingly Internet-enabled cellular wireless networks are also vulnerable to botnet attacks; a situation which motivates a thorough study of botnet expansion and the mathematical models thereof. In this paper, we propose the following two Continuous-Time Markov Chain-based models for prediction of the botnet size in the initial phase of botnet lifecycle: SComF for the case of finite number of susceptible nodes (suitable for a botnet expanding in a closed environment such as an administrative domain, or a LAN) and SComI for the case of infinite number of susceptible nodes (suitable for a botnet expanding in the larger Internet). Having access to such models would enable security experts to have reliable size estimates and therefore be able to defend against an emerging botnet with adequate resources. We derive the probability distributions for both models and provide some numerical results as well as a simulation study accompanying the numerical analysis of the SComF model using the GTNetS network simulator.
机译:Botnets已成为推出分布式拒绝服务攻击并协调大规模电子邮件垃圾邮件活动的平台,仅举一些与僵尸网络相关的邪恶活动。除了有线网络之外,还越来越互联网的蜂窝无线网络也容易受到僵尸网络攻击的影响;一种促使对僵尸网络扩展和其数学模型进行彻底研究的情况。在本文中,我们提出了以下两个连续时间马尔可夫链的基础模型,用于预测僵尸网络生命周期的初始阶段中的僵尸网络尺寸:Scomf为有限数量易感节点(适用于截止的僵尸网络扩展诸如行政域或LAN的环境,或者是无限数量易感节点的情况(适用于在较大的互联网中扩展的僵尸网络)的情况。访问此类模型将使安全专家能够具有可靠的大小估计,因此能够以适当的资源防御新兴僵尸网络。我们派生了两种模型的概率分布,并提供了一些数值结果以及使用GTNets网络模拟器的SCOMF模型的数值分析来提供一些数值结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号