CN111064661B - Routing protocol data transmission method with backup path in grouping equipment - Google Patents

Abstract

The invention discloses a routing protocol data transmission method with a backup path in grouping equipment. Computing backup routes for network conditions at the time of failure can result in a disruption of communications. The invention is as follows: firstly, creating a directed connected graph; II, connecting the source node V₀Transmission to node V_iEach path of (a) into a candidate set B_i. Fourthly, taking a candidate set B_iTaking the path with the minimum intermediate cost value as the main path x_i. Fifthly, taking a candidate set B_iTaking the path with the second smallest cost value as a candidate standby path y_i(ii) a Sixthly, if the alternative path y is available_iIf the requirement is satisfied, the candidate alternate path y is_iAs a final backup path y_i(ii) a Otherwise, the candidate alternate path y is replaced_i. The invention can calculate the standby path in advance when the fault does not occur, thereby ensuring that the path switching can be completed immediately when the fault occurs and reducing the loss caused by the fault to the minimum.

Description

Routing protocol data transmission method with backup path in grouping equipment

Technical Field

The invention belongs to the technical field of communication, and particularly relates to a routing protocol data transmission method with a backup path in packet-based equipment.

Background

The SPF algorithm refers to taking a local router as a root (root) to calculate the distance to each destination router, each router calculates the topology structure diagram of the routing domain according to a unified database, the structure diagram is similar to a tree, in the SPF algorithm, called shortest path tree, the SPF algorithm is the basis of the OSPF routing protocol.

The realization of the rapid recovery of a fault IP network on the basis of rapid fault detection is crucial to the realization of high reliability of network services, and the main solution to the problem in the industry at present is to calculate a backup route for the network condition during fault; however, the process of calculating the backup route may cause a communication interruption.

In order to realize the calculation of the route backup path, the common mode in the industry at present is realized by technologies such as loop-free path replacement, heavy address configuration, interface selection forwarding and the like; the loop-free replacement path has higher requirement on the network topology, can not realize the fault resolution of all network types, and has the protection rate of about 60 percent according to statistical analysis; the calculation amount of the re-address configuration route is large, one SPF calculation needs to be performed for each NVA address in the network independently, the data volume is large, an IGP protocol needs to be expanded, the message forwarding needs to increase the encapsulation and decapsulation processes, and the implementation is complex; interface selection forwarding requires maintaining different forwarding tables on each interface board, and is complex to implement in a traditional packetization device (distributed architecture design) and poor in stability.

Disclosure of Invention

The invention aims to provide a routing protocol data transmission method with a backup path in a grouping device in the grouping device.

The method comprises the following specific steps:

step one, determining a source node V₀And building a node set V ═ V₀,V₁,…,V_n-1}. Creating a directed connected graph; the directed connected graph G is composed of n nodes and edges E between the nodes that communicate with each other.

And step two, assigning 1 to i.

Step three, the source node V is connected₀Transmission to node V_iEach path of (a) into a candidate set B_i。

Step four, respectively calculating a candidate set B_iCost values for each path within. Get candidate set B_iTaking the path with the minimum intermediate cost value as the main path x_i。

Step five, taking a candidate set B_iTaking the path with the second smallest cost value as a candidate standby path y_i(ii) a And then entering step six.

Step six, if the candidate alternate path y_iIf the following two conditions are satisfied simultaneously, the candidate backup path y is determined_iAs a final backup path y_iEntering the step seven; otherwise, the candidate alternate path y is_iFrom candidate set B_iAnd (5) deleting and re-executing the step five.

Conditional ① finding primary path x_iAnd candidate alternate path y_iAre not crossed.

Condition ② relationship cost (x)_i)+cost(z)＞cost(y_i)-cost (z) holds; wherein, cost (x)_i) Is a primary path x_iAn overhead value of; cost (x)_i) Is a primary path x_iAn overhead value of; cost (y)_i) As candidate alternate path y_iThe overhead value of (c). cost (z) is the candidate alternate path y_iSecond node V of_zAnd source node V₀The path overhead in between.

Step seven, if i is less than n-1, increasing i by 1, and repeatedly executing the steps three to six; otherwise, go to step eight.

Step eight, source node V₀Communicating with each node through a corresponding main path; when source node V₀When the main path between the source node and a node is interrupted due to fault, the source node V₀And keeping the communication smooth by utilizing the corresponding standby path.

Preferably, the routing protocol data transmission method with the backup path is used in the OSPF routing protocol.

Preferably, the directed connected graph is obtained by an SPF sub-optimal algorithm.

The invention has the beneficial effects that:

1. the invention can calculate the standby path in advance when the fault does not occur, thereby ensuring that the path switching can be completed immediately when the fault occurs and reducing the loss caused by the fault to the minimum.

2. The invention considers the influence possibly brought by the fault of the main path when calculating the standby path, and ensures the reliability of the standby path calculated in advance.

3. The invention considers the possible occurrence of micro-ring phenomenon when calculating the standby path, and avoids the possible occurrence of network storm when the standby path is used.

Detailed Description

The present invention is further described below.

A routing protocol data transmission method with a backup path in a grouping device specifically comprises the following steps:

step one, the device (Router Lsa) is used as a source node V₀. N routers in a transmission network constitute a node V ═ V₀,V₁,…,V_n-1}. Establishing and creating a directed connected graph G (V, E) for n nodes in a transmission network according to an SPF suboptimal algorithm; the directed connected graph G is composed of n nodes and edges E between the nodes that communicate with each other. If node V_iAnd node V_jCommunication, then connecting node V_iAnd node V_jIs denoted as edge E_ij. Edge E_ijIs denoted as W_ij. Source node V₀P for total path set with k hops to other nodes_kAnd (4) showing. Source node V₀A path to a node is composed of a plurality of edges that are adjacent in sequence.

And step two, assigning 1 to i, and then executing step three.

Step three, using the node V_iAs target nodes, collecting the total paths P_kThe middle target node is a node V_iJoining the initially empty set of candidates B_i。

Step four, respectively calculating a candidate set B_iThe cost value of each path in the path, and a candidate set B_iThe paths in the path are sorted from small to large according to the overhead value. Get candidate set B_iTaking the path with the minimum intermediate cost value as the main path x_i. The cost value of a path is the sum of the path costs of the edges that make up the path.

Step five, taking a candidate set B_iThe path with the second smallest (i.e. the second smallest) cost value is used as the candidate backup path y_i(ii) a And then entering step six.

Step six, if the candidate alternate path y_iIf the following two conditions are satisfied simultaneously, the candidate backup path y is determined_iAs a final backup path y_iEntering the step seven; otherwise, the candidate alternate path y is_iFrom candidate set B_iDeleting, and re-executing step five to select new candidate backup path y_i。

Conditional ① finding primary path x_iAnd candidate alternate path y_iAre not intersected (i.e. the main path x)_iAnd candidate alternate path y_iNot going through the same node). This condition is used to ensure that,primary path x_iMust not affect the use of the backup path.

Condition ② relationship cost (x)_i)+cost(z)＞cost(y_i) -cost (z) holds; wherein, cost (x)_i) Is a primary path x_iAn overhead value of; cost (x)_i) Is a primary path x_iAn overhead value of; cost (y)_i) As candidate alternate path y_iThe overhead value of (c). cost (z) is the candidate alternate path y_iSecond node V of_z(direct connection Source node V₀Node(s) and source node V₀Edge E between_0zThe path overhead of (c). This condition is used to avoid the occurrence of micro-loops, thereby preventing the occurrence of network storms.

Step seven, if i is less than n-1, increasing i by 1, and repeatedly executing the steps three to six, thereby completing the path planning from the source node to the other nodes; otherwise, go to step eight.

Step eight, source node V₀Communicating with each node through a corresponding main path; when source node V₀When the main path between the upper computer and one node is interrupted due to faults, the upper computer controls a source node V₀And keeping the communication smooth by utilizing the corresponding standby path.

As a preferred technical scheme: the routing protocol data calculation method with the backup path is used in an OSPF routing protocol.

Claims (1)

1. A routing protocol data transmission method with a backup path in a grouping device is characterized in that: step one, determining a source node V₀And building a node set V ═ V₀,V₁,...,V_n-1}; creating a directed connected graph; the directed connected graph G consists of n nodes and edges E among the nodes which are communicated with each other;

assigning 1 to i;

step three, the source node V is connected₀Transmission to node V_iEach path of (a) into a candidate set B_i；

Step four, respectively calculating a candidate set B_iCost values of each path within; taking a candidate setB_iTaking the path with the minimum intermediate cost value as the main path x_i；

Step five, taking a candidate set B_iTaking the path with the second smallest cost value as a candidate standby path y_i(ii) a Then, entering a step six;

step six, if the candidate alternate path y_iIf the following two conditions are satisfied simultaneously, the candidate backup path y is determined_iAs a final backup path y_iEntering the step seven; otherwise, the candidate alternate path y is_iFrom candidate set B_iDeleting and re-executing the step five;

conditional ① finding primary path x_iAnd candidate alternate path y_iAre not crossed;

condition ② relationship cost (x)_i)+cost(z)＞cost(y_i) -cost (z) holds; wherein, cost (x)_i) Is a primary path x_iAn overhead value of; cost (y)_i) As candidate alternate path y_iAn overhead value of; cost (z) is the candidate alternate path y_iSecond node V of_zAnd source node V₀Path overhead in between;

step seven, if i is less than n-1, increasing i by 1, and repeatedly executing the steps three to six; otherwise, entering step eight;

step eight, source node V₀Communicating with each node through a corresponding main path; when source node V₀When the main path between the source node and a node is interrupted due to fault, the source node V₀And keeping the communication smooth by utilizing the corresponding standby path.