队列遍历算法的加权策略在蠕虫扩散中的应用  

Application for Weighted Strategy of Queue-Traversal Algorithm in Diffusion of Worm

作　　者：周佳骏[1,2] 汪婷婷[3,2] 韦刚[2] 

机构地区：[1]安庆师范学院,安徽安庆246003 [2]广西师范大学,广西桂林541004 [3]安阳工学院,河南安阳455000

出　　处：《计算机技术与发展》2009年第5期166-169,共4页Computer Technology and Development

基　　金：国家"973"重点资助项目(2002CB312105)

摘　　要：针对一般蠕虫不能感知目标环境及其改变,从而不能选择有效的扩散策略问题,采用加权树建模方法,给出一种蠕虫自动扩散模型,描述蠕虫"智能"扩散的本质特征和执行过程。基于队列遍历提出一种加权策略算法。分析和仿真实验结果表明,该模型具有较高的扩散效率,能够灵活描述和实现较为普遍的扩散。To deal with the serious problem that worms can usually not select effective diffusion strategy as target environment changed. Adopt the method of weighted tree, give an auto diffusion model and describe the essence character and execution process of wisdom diffusion of worm. Algorithm of weighted strategy has been given based on queue - traversal. Analysis and simulation experiment results illustrate that the new diffusion model of worm has better efficiency, and it is able to describe and achieve more prevalent diffusion process flexibly.

关 键 词：加权策略 队列遍历 算法 蠕虫 扩散 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]