• Acta Photonica Sinica
  • Vol. 41, Issue 12, 1400 (2012)
CAI Ting*, HUANG Shan-guo, LI Xin, YIN Shan, ZHANG Jie, and GU Wan-yi
Author Affiliations
  • [in Chinese]
  • show less
    DOI: 10.3788/gzxb20124112.1400 Cite this Article
    CAI Ting, HUANG Shan-guo, LI Xin, YIN Shan, ZHANG Jie, GU Wan-yi. Dynamic Survivable Mapping Algorithm Based on Ant Colony Optimization in IP over WDM Networks[J]. Acta Photonica Sinica, 2012, 41(12): 1400 Copy Citation Text show less

    Abstract

    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.
    CAI Ting, HUANG Shan-guo, LI Xin, YIN Shan, ZHANG Jie, GU Wan-yi. Dynamic Survivable Mapping Algorithm Based on Ant Colony Optimization in IP over WDM Networks[J]. Acta Photonica Sinica, 2012, 41(12): 1400
    Download Citation