基于最小路径交叉度的域内路由保护方案

已有的路由保护方案面临下面两个问题：（1）默认路径和备份路径包含的公共边数量较高，如ECMP和LFA等；（2）为了计算两条包含公共边数量较少的路径，限制默认路径不能使用最短路径，如红绿树方案等.针对上述两个问题，首先将计算默认路径和备份路径描述为一个整数规划问题，然后提出采用启发式方法求解该问题，接着介绍了转发算法，最后通过仿真实验和真实实验对算法进行了测试.实验结果表明，该算法不仅具有较低的计算复杂度，而且可以降低默认路径和最短路径包含的公共边的数量，提升网络可用性.

Intra-domain Routing Protection Scheme Based on Minimum Intersection Paths

The existing routing protection schemes are facing the following two problems: (1) the default path and the backup path contain a large number of common edges, such as ECMP and LFA; (2) in order to calculate two paths which have a small number of common edges, the shortest path cannot be used in the network, such as red-green tree method. To solve the above two problems, this study first describes the problem of computing backup paths and default paths as an integer programming model, and then a heuristic method is proposed to solve the problem. Next, the forwarding algorithm is introduced. Finally, the proposed algorithm is tested by simulation experiment and real experiment. Experiments show that the proposed algorithm not only has lower computational complexity, but also reduces the number of common edges contained in the default paths and the shortest paths, and greatly improve the network availability.