The industry usually adopts route protection scheme to improve the availability of intra-domain routing. However, the existing routing protection schemes have the following two problems: a) the failure probability of links in the network is not considered, and all links in the network are treated equally. In fact, in the Internet, the failure probability of different links is different, so the failure probability of links should be considered in the routing protection scheme. b) In fact, the protection of some links with high probability of error will increase the protection cost of some links. Therefore, routing availability should be the design goal of route protection scheme. To solve these two problems, this paper proposed an intra-domain routing protection scheme based on critical network state(RPBCNS). The algorithm first calculated all the critical network states through the link failure probability, and then calculated the corresponding paths between node pairs in each critical network state to ensure the diversity of paths between nodes, so as to make as many nodes as possible meet the routing availability requirements. The simulation experiment compared the RPBCNS algorithm with the mainstream algorithms ECMP, DC, and path splicing in three real networks. The performance of RPBCNS is better than the other three algorithms in terms of network availability and node availability satisfaction rate. Simulation results show that RPBCNS can make as many node pairs as possible to meet the routing availability goal, which is more in line with the actual needs of real-time applications.

[2021-10-05] Printed Article /doc/2021.03.0089/v2