基于弧不相交着色树的多链路故障恢复方法  

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

作　　者：张亚坤[1] 孟相如[1] 崔文岩[1] 赵志远[1] ZHANG Yakun;MENG Xiangru;CUI Wenyan;ZHAO Zhiyuan(Institute of Information and Navigation, Air Force Engineering University, Xi-an 710077, China)

机构地区：[1]空军工程大学信息与导航学院,西安710077

出　　处：《计算机工程与应用》2017年第14期87-92,共6页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61201209)

摘　　要：为实现网络多链路故障快速恢复,提出一种基于弧不相交着色树重路由的恢复方法。通过改进着色树机制,建立弧不相交着色树生成模型,提出一种改进的布谷鸟算法,引入动态调整步长操作降低陷入局部极值的概率,优化着色树求解。仿真实验表明,该方法不仅能够实现网络多链路故障的完全覆盖,还可获得较短的恢复路径。To achieve fast recovery of multi-link failures,a reroute method is proposed based on arc-disjiont coloredtrees.By improving mechanism,the model is established and an improved Cuckoo search algorithm is proposed in orderto optimize generating procedure.At the same time,the probability of converging to local optima is reduced by employingadaptive step operator.The experimental results show that the approach can not only achieve full coverage of multi-linkfailures but also relatively short recovery path stretch.

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]