基于混合蛙跳的网络生存性计算方法  

Novel calculation method of network survivability based on shuffled frog leaping

作　　者：赵攀[1] 魏正曦[1] 张弘[1] 

机构地区：[1]四川理工学院计算机系,四川自贡643000

出　　处：《计算机工程与设计》2013年第11期3801-3805,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(60372013);人工智能四川省重点实验室开放基金项目(2012RYY02);四川理工学院培育基金项目(2012PY13)

摘　　要：为了解决网络生存性的评价问题,基于混合蛙跳算法提出了一种新的计算方法SSFL(survivability-based on shuffled frog leaping)。利用网络剩余流量和网络剩余能量给出了生存性定义,并结合混合蛙跳算法设计了生存性算法流程,以此获得最大网络剩余能量;利用OPNET和MATLAB进行仿真实验,深入研究了网络生存性与失效链路、权重系数等参数之间的关系。仿真结果表明,相比于其它方法,SSFL表现出较好的适应性。To solve the evaluation problem of network survivability, a new calculated method named SSFL （survivability-based on shuffled frog leaping） is proposed based on shuffled frog leaping algorithm. In this method, the definition of survivability is presented by network remaining flow and network remaining energy, and the survivability algorithm process is designed with shuffled frog leaping to get the maximum network remaining energy, a simulation is conducted to study the relationship among network survivability, failures link and weight factor using OPNET and MATLAB, the results show SSFL algorithm has better adaptability compared with other method.

关 键 词：生存性 剩余流量 剩余能量 失效 混合蛙跳 

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