基于不相交路径的域内路由保护方案  

Intra-domain Routing Protection Scheme Based on Disjoint Path

作　　者：耿海军 刘洁琦 张举 GENG Haijun;LIU Jieqi;ZHANG Ju(School of Software Engineering,Shanxi University,Taiyuan 030006,China)

机构地区：[1]山西大学软件学院,太原030006

出　　处：《计算机工程》2018年第12期140-144,149,共6页Computer Engineering

基　　金：国家自然科学基金(61702315)

摘　　要：目前的路由保护方案备份路径与默认路径交叉度较高,为寻找交叉度较低的两条路径,默认路径可能不利用最短路径。为此,提出一种新的域内路由保护方案。将问题描述为整数规划模型,利用遗传算法计算近似最优解,并在大量拓扑结构上对算法进行模拟。实验结果表明,该方案降低了默认路径和备份路径的交叉度,可有效提高网络的可靠性,提升用户体验。The backup path of current routeing protection scheme has a high degree of crossover with the default path.To find two paths with low crossover,the default path may not utilize the shortest path.Therefore,a new intra-domain routing protection scheme is proposed.The problem is described as an integer programming model.The Genetic Algorithm(GA)is used to calculate the approximate optimal solution.The algorithm is simulated on a large number of topologies.Experimental results show that the scheme greatly reduces the crossover between the default path and the backup path,and improves the reliability of the network,and the user experience has improvement.

关 键 词：默认路径 备份路径 网络故障 整数线性规划 遗传算法 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]