计算机应用研究Issue(11)：3455-3459,5.DOI:10.3969/j.issn.1001-3695.2014.11.058
广播网络病毒进化模型算法研究
Study of epidemic evolution optimization algorithm in broadcasting networks
摘要
Abstract
Epidemic evolution optimization studies the spreading process of a computer or biological virus in a network.It controls the epidemic evolution rate under limited network resources and to study how the network users are to be infected. Epidemic evolution can be modeled by a dynamic probabilistic system over a connected graph.Traditional epidemic evolution models require solving a non-convex optimization problem objected at the spectral radius of a non-negative matrix.To solve this optimization problem,this paper proposed two algorithms.Based on the successive convex approximation,the first one was sub-optimal but computationally fast;the second one could compute the global optimal solution by using branch-and-bound tech-niques that leverage some key tools of non-negative matrix theory.Simulation results based on traditional evolutional models show that the algorithm can make the epidemic evolution process converge to the global optimal,and has a fast convergence rate under different network environments.关键词
病毒进化/谱半径最小化/非负矩阵理论Key words
epidemic evolution/spectral radius minimization/non-negative matrix theory分类
信息技术与安全科学引用本文复制引用
郭红转,杨艳燕,赵佳佳,任平安..广播网络病毒进化模型算法研究[J].计算机应用研究,2014,(11):3455-3459,5.基金项目
国家自然科学基金资助项目 （）
河南省科技攻关资助项目 （）
