Analysis of SRv6 intra-domain routing protection method

Abstract

In order to master and understand the SRv6 intra-domain routing protection method, the SRv6 intra-domain routing protection method was analyzed in detail, and the calculation rules of backup path and Segment List were expounded, including path redundancy, link quality and fault recovery time. The Dijkstra algorithm, K shortest path algorithm and topology-aware algorithm are used to analyze the algorithm, and the effectiveness of these rules and algorithms was verified in the experiment. Finally, by comparing the experimental results, the performance and applicable scenarios of each algorithm in different network environments are obtained, which provides a scientific calculation method and effective algorithm selection basis for routing protection in SRv6 domain.

Keywords

• SRv6
• intra-domain routing
• protection method
• network failure