一种新的ASON恢复容量优化算法  

Novel Algorithm to Optimize the Capacity of the Restoration of ASON

作　　者：徐俊[1] 常会友[1] 衣杨[1] 

机构地区：[1]中山大学信息科学与技术学院,广州510275

出　　处：《计算机科学》2009年第11期228-229,234,共3页Computer Science

基　　金：基于人工生命计算的计算协同关键问题研究(60573159)资助

摘　　要：针对ASON网络恢复容量问题,建立了相应的数学模型并提出了一种基于粒子群的恢复容量优化算法。与线性规划寻优方法相比,该算法的可行解搜索空间及计算量大大降低,为算法在工程上的实现提供了可行性。该算法可处理不同故障情况下的多种最佳恢复路由的选取问题,能有效地解决链路波长信道恢复容量的"碎片"问题。仿真实验验证了该算法具有较强的实用性。In order to solve the NP-completely nonlinear programming of ASON restoration capacity assignment, the corresponding mathematical model was established and a new optimization method based on particle swarm optimization algorithm was presented in this paper. Compared with liner programming optimization method, this algorithm reduces the calculation work significantly, which facilitates the application of algorithm on projects. The algorithm can handle a variety of the best restoration routing of selected issues in the different failure eases and effectively address the ＂debris＂ problem of restoration capacity. The simulation experiments show that the algorithm is highly practical.

关 键 词：ASON 格状网 网络生存性 恢复容量 粒子群算法 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]