摘要
计算机网络病毒在全球范围迅速蔓延,在对普通用户造成危害的同时也使全球特别是亚洲地区的因特网主干网一度瘫痪。文章主要针对网络病毒的传播机制进行研究,希望找出一种能够计算病毒传播的时间的数学期望的算法。文中根据病毒在网络上随机传播的各种特性分别进行数学建模,通过比较分析不同方法的利弊,最终找到一种相对准确的算法用以计算出:在某种给定的网络拓扑结构中,某一个节点被感染后,另外一个节点被感染的时间的数学期望值。但是由于该算法计算复杂性较高,故笔者提出相应的优化方法。
Computer viruses are now spreading quickly over the Internet worldwide,which are extremely harmful not only to common users but also to the network infrastructure.This disquisition is focusing on the mechanism of virus spreading,giving a discussion and research to algorithms which can calculate the expectation of the spreading time.By comparing the algorithms provided,one is finally considered to be accurate, which can calculate the expectation ofthe spreading time starting from the time that one node is infected to the timethat another specific node is infected in a given topology of a network.Since the algorithm is of a bit high complexity,several ways of optimizing the process is provided in the end of this disquisition.
出处
《微机发展》
2004年第12期59-61,64,共4页
Microcomputer Development
关键词
计算机网络
计算机病毒
概率
数学期望
图
算法
优化
computer network
computer virus
probability
expect
graph
algorithm
optimization
