韧性度约束下抗毁网络拓扑规划算法

On Survivable Network Topology Optimization under the Restraint of Tenacity

韧性度是衡量网络拓扑结构脆弱性的有效指标,它描述了网络在节点失效或遭遇外来攻击时被断裂的难易程度、断裂后剩余子网的连通性及重新连通断裂子网的难易程度,采用韧性度判据来衡量网络结构的抗毁性,可以在一定程度上避免连通度的不足。为解决韧性度约束下的最小网络拓扑规划问题,文章提出了一种基于准并行遗传算法的拓扑规划方法,该方法通过在初始种群中加入特定个体来扩大其覆盖率,利用不同结构种群独立进化的方法来防止早熟。仿真实验表明了算法的有效性。

Using tenacity as a criterion of survivable network design can avoid the limitation of connectivity to a certain extent,but the complexity of computation is a great obstacle.A quasi-parallel genetic algorithm is presented to accelerate the computing speed by using more computers.The algorithm focuses on the problem of mini-network topology planning under the restraint of tenacity.In this algorithm, several sub-populations evolve independently,each sub-population can evolve in different modes with different ...