K-Shell algorithm-based active fault fast rerouting method applied in IP network

Abstract

The invention provides a K-Shell algorithm-based active fault fast rerouting method applied in an IP network. The method comprises the steps that 1, all nodes are decomposed by means of a K-Shell algorithm to obtain multiple layers of core nodes, wherein each layer comprises a plurality of core nodes; 2, the contribution degrees of all neighbor nodes of each core node to the core node are calculated according to the correlation among the nodes; 3, the importance degree of each core node is calculated according to the contribution degrees of all the nodes; 4, all the core nodes are arranged according to the order of the importance degrees from high to low to obtain a core node sequence; 5, a plurality of core nodes are selected from the core node sequence to serve as key nodes; 6, a backuptopology is created, wherein each key node in the backup topology is adjacent to multiple protected links; and 7, link protection is conducted on ordinary nodes except the key nodes by using an MRC algorithm. According to the method, the fault problem of a single link or node in the network can be effectively solved, network storage resources can be saved, and the length difference with a shortestpath obtained after routing re-convergence is small.

Description

technical field [0001] The invention relates to the technical field of Internet communication, in particular to an active fault fast rerouting method based on a K-Shell algorithm in an IP network. Background technique [0002] With the large-scale popularization of real-time services sensitive to delay and packet loss, users have increasingly strict requirements on network performance. For real-time services such as IP telephony, streaming media, online games, and remote video conferencing, packet loss or long delay will significantly reduce their performance or even cause service interruption. Therefore, how to avoid packet loss and reduce delay has become a problem that network operators have to face. Since commercial IP networks have strict requirements on service quality, it must be able to reroute data packets in a timely manner when a failure occurs. The method of changing protocol parameters can only compress the convergence time to sub-second level at most, which s...

AI Technical Summary

Problems solved by technology

However, after using the K-Shell decomposition algorithm to peel off the network layer by layer, the core node set obtained does not consider the influence of the local environment where the important nodes are located, resulting in an inaccurate assessment of the importance of the nodes

Images