论文部分内容阅读
随着光网络规模的不断扩大以及网络体系结构的扁平化过程加速,网络传输的可靠性和实时性以及生存性路面算法本身面临新的挑战.本文在单点割集的松弛生存性约束条件下,结合动态业务下的IP over WDM光网络的特点,借助蚁群优化算法的强鲁棒性和记忆能力,通过改变与调整蚁群优化算法结构中的信息素结构与其更新机制,在动态路由选择过程中,引入网络可生存性约束信息改进路由选择概率计算机制,来实现IP over WDM光网络动态生存性映射的路由策略.与其他同类算法相比,该算法不再存储网络备用路由集和物理拓扑自身庞大的割集关系,在保证网络生存性效果的前提下,通过割集松弛条件有效降低了计算的时间复杂度,提高算法收敛速度,适应网络实时性要求.仿真结果表明:与传统最短路算法比较,该算法能有效提高动态光网络的可生存性映射性能和网络的资源利用效率,并降低业务阻塞率.
With the continuous expansion of the optical network and the flattening of the network architecture, the reliability and real-time of network transmission and the survivability of the pavement algorithm are faced with new challenges.In this paper, under the constraints of relaxed survivability of single point cut sets , Combined with the characteristics of IP over WDM optical network under dynamic business, with the strong robustness and memory ability of ant colony optimization algorithm, by changing and adjusting the pheromone structure and its updating mechanism in the structure of ant colony optimization algorithm, In the process, the network survivability constraint information is introduced to improve the routing probability calculation mechanism to realize the routing strategy of the dynamic survivability mapping of IP over WDM optical network.Compared with other similar algorithms, the algorithm no longer stores the network standby routing set and the physical Under the precondition of ensuring the survivability of the network, the slack condition can effectively reduce the computational time complexity, improve the convergence speed of the algorithm, and meet the real-time requirements of the network.The simulation results show that: compared with the traditional shortest path length Road algorithm, the algorithm can effectively improve the survivability of dynamic optical network mapping and network resources Use efficiency and reduce traffic congestion rates.