Intra-Domain Routing Protection Scheme Based on the Minimum Cross-Degree Between the Shortest Path and Backup Path

With the continuous development of the Internet, people have put forward higher requirements for the stability and availability of the network. Although we constantly strive to take measures to avoid network failures, it is undeniable that network failures are unavoidable. Therefore, in this situation, enhancing the stability and reliability of the network to cope with possible network failures has become particularly crucial. Therefore, researching and developing high fault protection rate intra-domain routing protection schemes has become an important topic and is the subject of this study. This study aims to enhance the resilience and service continuity of networks in the event of failures by proposing innovative routing protection strategies. The existing methods, such as Loop Free Alternative (LFA) and Equal Cost Multiple Paths (ECMP), have some shortcomings in terms of fast fault detection, fault response, and fault recovery processes, such as long fault recovery time, limitations of routing protection strategies, and requirements for network topology. In response to these issues, this article proposes a new routing protection scheme, which is an intra-domain routing protection scheme based on the minimum cross-degree backup path. The core idea of this plan is to find the backup path with the minimum degree of intersection with the optimal path, in order to avoid potential fault areas and minimize the impact of faults on other parts of the network. Through comparative analysis and performance evaluation, this scheme can provide a higher fault protection rate and more reliable routing protection in the network. Especially in complex networks, this scheme has more performance and protection advantages than traditional routing protection methods. The proposed scheme in this paper exhibits a high rate of fault protection across multiple topologies, demonstrating a fault protection rate of 1 in the context of real topology. It performs commendably in terms of path stretch, evidenced by a figure of 1.06 in the case of real topology Ans, suggesting robust path length control capabilities. The mean intersection value is 0 in the majority of the topologies, implying virtually no common edge between the backup and optimal paths. This effectively mitigates the risk of single-point failure.

Abstract licence: CC BY

28 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.