Optimising Networks Against Malware

P. Bureau, José M. Fernandez
{"title":"Optimising Networks Against Malware","authors":"P. Bureau, José M. Fernandez","doi":"10.1109/PCCC.2007.358935","DOIUrl":null,"url":null,"abstract":"Rapidly-spreading malicious software is an important threat on today's computer networks. Most solutions that have been proposed to counter this threat are based on our ability to quickly detect the malware-generated traffic or the malware instances themselves, something that in many cases can be beyond our ability. Nonetheless, it seems intuitive that certain defensive postures adopted in configuring networks or machines can have a positive impact on countering malware, regardless of our ability to detect it. It is thus important to quantitatively understand how changes in design and deployment strategies can affect malware performance; only then does it become possible to make optimal decisions. To that purpose, we study in this paper the impact of network interconnection topologies on the propagation of malware. We first use a theoretical model based on Markov processes to try to predict the progression of an infection under varying interconnection scenarios. We then compare these predictions with experimental results obtained by launching a malware emulation agent on three differently configured networks. Both theoretical and experimental results provide quantitative confirmation of the intuition that networks with higher degrees of interconnection allow faster spread of malware. In addition to this, we believe that the models, experimental methodology and tools described here can be safely and fruitfully used to study other aspects of malware performance, and hence of the relative effectiveness of defensive counter-measures.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Performance, Computing, and Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2007.358935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Rapidly-spreading malicious software is an important threat on today's computer networks. Most solutions that have been proposed to counter this threat are based on our ability to quickly detect the malware-generated traffic or the malware instances themselves, something that in many cases can be beyond our ability. Nonetheless, it seems intuitive that certain defensive postures adopted in configuring networks or machines can have a positive impact on countering malware, regardless of our ability to detect it. It is thus important to quantitatively understand how changes in design and deployment strategies can affect malware performance; only then does it become possible to make optimal decisions. To that purpose, we study in this paper the impact of network interconnection topologies on the propagation of malware. We first use a theoretical model based on Markov processes to try to predict the progression of an infection under varying interconnection scenarios. We then compare these predictions with experimental results obtained by launching a malware emulation agent on three differently configured networks. Both theoretical and experimental results provide quantitative confirmation of the intuition that networks with higher degrees of interconnection allow faster spread of malware. In addition to this, we believe that the models, experimental methodology and tools described here can be safely and fruitfully used to study other aspects of malware performance, and hence of the relative effectiveness of defensive counter-measures.
针对恶意软件优化网络
迅速传播的恶意软件是当今计算机网络的一个重要威胁。针对这种威胁提出的大多数解决方案都是基于我们快速检测恶意软件生成的流量或恶意软件实例本身的能力,而在许多情况下,这可能超出了我们的能力。尽管如此,在配置网络或机器时采用的某些防御姿态似乎可以对对抗恶意软件产生积极影响,而不管我们是否有能力检测到它。因此,定量地了解设计和部署策略的变化如何影响恶意软件的性能是很重要的;只有这样,才有可能做出最佳决策。为此,本文研究了网络互连拓扑结构对恶意软件传播的影响。我们首先使用基于马尔可夫过程的理论模型来尝试预测在不同互连场景下感染的进展。然后,我们将这些预测与通过在三个不同配置的网络上启动恶意软件仿真代理获得的实验结果进行比较。理论和实验结果都定量地证实了这样一种直觉,即互联程度越高的网络,恶意软件的传播速度越快。除此之外,我们相信这里描述的模型、实验方法和工具可以安全而有效地用于研究恶意软件性能的其他方面,从而研究防御对策的相对有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信