检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,长沙410083
出 处:《计算机工程》2008年第24期13-15,共3页Computer Engineering
基 金:湖南省自然科学基金资助项目(05JJ40132);中南大学理科发展基金资助项目;中南大学博士后科学基金资助项目
摘 要:提出一种采用P2P的良性蠕虫传播策略,建立了数学模型,在理论上分析各项参数对其传播情况的影响,并使用SSFNET网络仿真工具对传播模型进行了仿真。仿真结果证明,P2P良性蠕虫可以有效地在授权网络中抑制恶意蠕虫的传播,P2P覆盖的平均度数越高,初始投放数量越多,投放时间越早,P2P良性蠕虫传播就越快。P2P良性蠕虫继承了P2P覆盖网络的特点,使其传播的稳定性、可控性更好,并具有更低的消耗。Anti-worms are good mobile codes which can travel over the computer networks to fight against malicious worms. Existing anti-worms are often written by hackers. Sometimes these anti-worms even do more harm to networks than malicious worms. Recently, their effect has not been fully explored. This paper proposes a new kind of anti-worm called P2P anti-worm which propagates using P2P techniques. It presents a mathematical analysis and gives a mathematical mode of P2P anti-worm to analyze the propagation and uses SSFNET to simulate the P2P anti-worm vs. pure random scan worm. Results show that P2P anti-worm can slow down the speed of the malicious worm. The paper discusses the relation between the propagation speed and the P2P overlay average degree, the initial number of the anti-worm and the release time delay. Moreover, it finds that the P2P feature makes the anti-worm safer, propagate more stabile, more controllable and cost less.
关 键 词:P2P良性蠕虫 稳定性 低耗性 可控性 SSFNET工具
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.49.6