期刊文献+

良性蠕虫的B+地址树扩散策略 被引量:1

B+ Address Tree Diffusion Strategy for Benign Worm
下载PDF
导出
摘要 为提高良性蠕虫对抗恶意蠕虫时的效率,提出一种良性蠕虫的B+地址树扩散策略。在传递的信息中带有控制信息,主动扩散并行信息,以便使良性蠕虫处于可控的扩散状态。根据B+地址树设计动态生成算法,利用Scilab进行扩散模拟测试。测试结果表明,与已有策略相比,该策略的良性蠕虫扩散速度更快,对网络的影响更小。 In order to improve the efficiency of the benign worm when fight against the malicious worm, this paper proposes a B+ address tree diffusion strategy for benign worm. It actively spreads the parallel information. In passing information, there is control information, so as to make the benign worms in a controllable diffusion state. According to B+ address tree, it designs the dynamic generation algorithm, and uses Scilab to do the diffusion simulation test. Testing results show that this strategy has faster propagation speed and less network impact on network compared with the traditional ones.
出处 《计算机工程》 CAS CSCD 2012年第6期135-138,共4页 Computer Engineering
基金 国家自然科学基金资助项目(60873234)
关键词 良性蠕虫 传播模型 扩散策略 B+地址树 benign worm propagation model diffusion strategy B+ address tree
  • 相关文献

参考文献8

  • 1王秀英,邵志清,刘百祥.P2P环境下的蠕虫检测算法[J].计算机工程,2009,35(3):173-175. 被引量:4
  • 2Lockwood J W, Moscola J, Kulig M, et al. Internet Worm and Virus Protection in Dynamically Reconfigurable Hardware[C]// Proceedings of ACM CCS Workshop on Rapid Malcode’03. Washington D. C., USA: [s. n.], 2003.
  • 3Weaver N, Paxson V, Staniford S, et al. Large Scale Malicious Code: A Research Agenda[EB/OL]. (2010-11-21). http://www. cs.berkeley.edu/~nweaver/.
  • 4Provos N. A Virtual Honeypot Framework[R]. Center of Information Technology Integration, University of Michigan, Tech. Rep.: citi-tr-03-1, 2003.
  • 5王佰玲,方滨兴,云晓春,张宏莉,陈博,刘乙璇.基于平衡树的良性蠕虫扩散策略[J].计算机研究与发展,2006,43(9):1593-1602. 被引量:8
  • 6Staniford S, Moore D, Paxson V, et al. The Top Speed of Flash Worms[C]//Proc. of ACM CCS Workshop on Rapid Malcode’04. Washington D. C., USA: [s. n.], 2004.
  • 7Staniford S, Paxson V, Weaver N. How to Own the Internet in Your Spare Time[C]//Proc. of the 11th USENIX Security Symposium. [S. l.]: USENIX Association, 2002.
  • 8邓映轶.对等网络蠕虫及其防御技术研究[D].成都:电子科技大学,2007.

二级参考文献9

  • 1文伟平,卿斯汉,蒋建春,王业君.网络蠕虫研究与进展[J].软件学报,2004,15(8):1208-1219. 被引量:187
  • 2Zou Changchun, Gong Weibo, Towsley D. Code Red Worm Propagation Modeling and Analysis[C]//Proceedings of the 9th ACM Conference on Computer and Communications Securit. New York, USA: ACM Press, 2002: 138-147.
  • 3Venkataraman S, Song D, Gibbons P, et al. New Streaming Algorithms for Fast Detection of Superspreaders[EB/OL]. (2005- 02-04). http://www.isoc.org/isoc/conferences/ndss/05/proceedings/ papers/superspreader.pdf.
  • 4Bailey M, Cooke E, Jahanian F, et al. The Internet Motion Sensor: A Distributed Blackhole Monitoring System[EB/OL]. (2005-02-04). http://www.csd.uoc.gr/-gvasil/stuff/papers/ims-ndss05.pdf.
  • 5Lee W, Stolfo S. Data Mining Approaches for Intrusion Detection[EB/OL]. (1998-10-12). http://www.usenix.org/publica tions/library/proceedings/sec98/full_papers/lee/lee.pdf.
  • 6Gray R M. Entropy and Information Theory[M]. New York, USA: Springer Verlag, 1990.
  • 7Matzinger E The Danger Model in Its Historical Context[J]. Scandinavian Journal of Immunology, 2001, 54(1/2): 4-9.
  • 8丁伟,潘建平,龚俭,顾冠群.计算机会议环境的信息扩散模型分析[J].计算机研究与发展,1998,35(1):24-29. 被引量:2
  • 9左晓栋,戴英侠.“狮子”蠕虫分析及相关讨论[J].计算机工程,2002,28(1):16-17. 被引量:17

共引文献11

同被引文献10

  • 1王晓锋,方滨兴,云晓春,张宏莉.并行网络模拟中的一种拓扑划分方法[J].通信学报,2006,27(2):16-21. 被引量:14
  • 2Fujimoto R M.Parallel discrete event simulation[J].Communications of the ACM,1990,33(10):30-53.
  • 3George F Riley.Using the georgia tech network simulation[EB/OL].http;//www.ece.gatech.edu/research/labs/MANIACS/ GTNets/docs/GTN ets-manual,pdf.
  • 4Castaneda F,Sezer E C,XU J.WORM vs.WORM:preliminary study of an active counter-attack mechanism[C]//Proceedings of the 2004 ACM Workshop on Rapid Malcode.Washington! DC:Association for Computing Machinery,2004;83-93.
  • 5Tangmunarunkit H,Govindan R,Jamin S,et al.Network topology generators:degree-based vs.structural[J].Proceedings of Acm Sigcomm Computer Communication Review.Pennsylvania:[s.n.],2002,31(4):147-159.
  • 6George K,Kumar V P.METIS-a software package for partitioning unstructured graphs,partitioning meshes,and computing fill- reducing orderings of sparse matrices,version 4.0[R].Twin Cities:University of Minnesota,1998.
  • 7Dijkstra E W.A note on two problems in connexion with graphs[J].Numerische Mathematik,1959(1):269-271.
  • 8杨望.CAIDA提供互联网数据共享服务[J].中国教育网络,2008(5):27-28. 被引量:4
  • 9杨昱.网络蠕虫的检测和防治[J].网络安全技术与应用,2013(12):83-84. 被引量:1
  • 10庄新妍,刘扬,董改芳.基于网格的蠕虫行为模拟器[J].内蒙古农业大学学报(自然科学版),2014,35(2):151-157. 被引量:1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部