Computer Engineering and Applications ›› 2017, Vol. 53 ›› Issue (14): 87-92.DOI: 10.3778/j.issn.1002-8331.1602-0126

Previous Articles     Next Articles

Recovery method for multi-link failures based on arc-disjiont colored trees

ZHANG Yakun, MENG Xiangru, CUI Wenyan, ZHAO Zhiyuan   

  1. Institute of Information and Navigation, Air Force Engineering University, Xi’an 710077, China
  • Online:2017-07-15 Published:2017-08-01



  1. 空军工程大学 信息与导航学院,西安 710077

Abstract: To achieve fast recovery of multi-link failures, a reroute method is proposed based on arc-disjiont colored trees. By improving mechanism, the model is established and an improved Cuckoo search algorithm is proposed in order to optimize generating procedure. At the same time, the probability of converging to local optima is reduced by employing adaptive step operator. The experimental results show that the approach can not only achieve full coverage of multi-link failures but also relatively short recovery path stretch.

Key words: multi-link failures, fast recovery, colored trees, Cuckoo search algorithm

摘要: 为实现网络多链路故障快速恢复,提出一种基于弧不相交着色树重路由的恢复方法。通过改进着色树机制,建立弧不相交着色树生成模型,提出一种改进的布谷鸟算法,引入动态调整步长操作降低陷入局部极值的概率,优化着色树求解。仿真实验表明,该方法不仅能够实现网络多链路故障的完全覆盖,还可获得较短的恢复路径。

关键词: 多链路故障, 快速恢复, 着色树, 布谷鸟算法