- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
ISSN 1000-9825, CODEN RUXUEW E-mail: jos@
Journal of Software , Vol.21, No.4, April 2010, pp.802−815
doi: 10.3724/SP.J.1001.2010.03514 Tel/Fax: +86-10
© by Institute of Software , the Chinese Academy of Sciences . All rights reserved.
∗
推测网络蠕虫传播路径的在线聚积算法
1,2+ 1,2
李 强 , 向 阳
1(吉林大学 计算机科学与技术学院,吉林 长春 130012)
2(吉林大学 符号计算与知识工程教育部重点实验室,吉林 长春 130012)
Algorithm of Online Accumulation for Reconstructing the Path of Worm Propagation
LI Qiang1,2+, XIANG Yang1,2
1(College of Computer Science and Technology, Jilin University, Changchun 130012, China)
2(Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012,
China)
+ Corresponding author: li_qiang@
Li Q, Xiang Y. Algorithm of online accumulation for reconstructing the path of worm propagation. Journal
of Software, 2010,21(4):802−815. /1000-9825/3514.htm
Abstract : Tracing online propagation paths when worm breaks out on a large scale can improve the network’s
anti-attackability. The existing tracing approaches to obtain worm propagation path are all based on off-line analysis
and usually have a lower accuracy. This paper proposes an online Accumulation Algorithm with sliding detection
windows, which can fleetly and efficiently trace the origin and initial causal edges of the worm. The algorithm
solves the conflicts in choosing causal edges and tackles the problem of merging propagation paths in the
consecutive reconstruction phase. The algorithm’s accuracy and performance have been analyzed. Experimental
results reveal that the
文档评论(0)