基于蚁群优化的IP over WDM光网络动态生存性映射算法

随着光网络规模的不断扩大以及网络体系结构的扁平化过程加速,网络传输的可靠性和实时性以及生存性路面算法本身面临新的挑战.本文在单点割集的松弛生存性约束条件下,结合动态业务下的IP over WDM光网络的特点,借助蚁群优化算法的强鲁棒性和记忆能力,通过改变与调整蚁群优化算法结构中的信息素结构与其更新机制,在动态路由选择过程中,引入网络可生存性约束信息改进路由选择概率计算机制,来实现IP over WDM光网络动态生存性映射的路由策略.与其他同类算法相比,该算法不再存储网络备用路由集和物理拓扑自身庞大的割集关系,在保证网络生存性效果的前提下,通过割集松弛条件有效降低了计算的时间复杂度,提高算法收敛速度,适应网络实时性要求.仿真结果表明:与传统最短路算法比较,该算法能有效提高动态光网络的可生存性映射性能和网络的资源利用效率,并降低业务阻塞率.

Dynamic Survivable Mapping Algorithm Based on Ant Colony Optimization in IP over WDM Networks

With the constant expansion of the optical networking and network architecture flattening process accelerated, network transmission reliability and timeliness are facing new challenges, which brought a new challenge to the survivability routing algorithm. In order to realize dynamic survivable mapping of IP routing to WDM based optical networks, with strong robustness and memory capacity of the ant colony optimization algorithm, a novel pheromone structure and pheromone update mechanism is proposed and survivable constraint information is also introduced to improve the probability mechanism of routing selection. The survivable mapping considers the cut sets of all single node and the dynamic characteristics of the IP over WDM network. Compared with other similar algorithm, the algorithm is no longer an alternate route set and the physical topology of the storage network itself huge cut-set relationship, under the premise of ensuring network survivability effect by cut-set relaxation conditions effectively reduce the computation time complexity to improve the convergence rate to adapt to the real-time requirements of the network. Simulation results show that the proposed algorithm can effectively improve the performance of survivable mapping, network resource utilization efficiency and the blocking rate compared with the shortest path algorithm.