基于元胞退火算法的网络生存性研究  

The study of network survivability based on cellular annealing algorithm

作　　者：赵攀[1] 

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

出　　处：《四川大学学报（自然科学版）》2014年第1期59-63,共5页Journal of Sichuan University(Natural Science Edition)

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

摘　　要：针对通信网络因链路失效而产生的网络拥塞问题,结合元胞自动机和模拟退火算法提出了一种新的网络生存性评价方法SACA(Survivability Algorithm based on Cellular Annealing).该方法首先给出了网络生存性定义,并且通过元胞演化规则来改进模拟退火算法中的变异和交叉操作,以此获得网络剩余数据传输量.同时,利用NS2和MATLAB进行仿真实验,深入研究了网络有效性与失效边数等影响因素之间的关系.结果表明,相比于其它算法,SACA算法具有较好的适应性.In order to mitigate the network congestion by node failures, a novel survivability evaluation method （Survivability Algorithm based on Cellular Annealing, SACA） is proposed by cellular automata and simulated annealing algorithm. In this method, the definiton of novel survivability is presented, and variation and intersection operations is improved with cellular evolution rules to get the remaining a- mount of network data transmission. Then, a simulation was conducted to study the relationship be- tween network survivability and the number of failures linker in NS2 and MATLAB. The results show that, compared other algorithm, SACA algorithm has better adaptability.

关 键 词：生存性 元胞自动机 模拟退火 失效 变异 交叉 

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