Method and apparatus for determining intermediate routing node and system

1. A method for determining an intermediate routing node, comprising:

determining at least one intermediate routing node that is used to transfer to-be-transmitted data between two routing nodes when there is a fault in a communication path between the two routing nodes;

adding a channel dependency relationship between a to-be-verified intermediate routing node and the two routing nodes to a channel dependency graph of a routing network in which this fault has not occurred in order to enable the channel dependency graph to become an updated channel dependency graph, wherein the to-be-verified intermediate routing node is any one of the at least one intermediate routing node, wherein the channel dependency relationship is a combination of channels in which the two routing nodes perform data transmission using the to-be-verified intermediate routing node, and wherein the channel dependency graph of the routing network in which this fault has not occurred is used to describe a dependency relationship constituted by any two channels in the routing network in which this fault has not occurred, or a combination of a dependency relationship constituted by any two channels in the routing network in which this fault has not occurred and a channel dependency relationship that is established before the fault; and

determining the to-be-verified intermediate routing node as a final intermediate routing node that is used to transfer the to-be-transmitted data when the updated channel dependency graph does not have a dependency relationship loop,

wherein the dependency relationship loop is a loop constituted by a channel dependency relationship combination.

2. The method according to claim 1 , wherein adding the channel dependency relationship between the to-be-verified intermediate routing node and the two routing nodes to the channel dependency graph of the routing network in which this fault has not occurred in order to enable the channel dependency graph to become the updated channel dependency graph comprises:

searching, according to a transmission direction of the to-be-transmitted data, the channel dependency graph of the routing network in which this fault has not occurred, to find a last channel in a path between a source routing node of the two routing nodes and the to-be-verified intermediate routing node and a first channel in a path between the to-be-verified intermediate routing node and a destination routing node of the two routing nodes;

determining the last channel in the path between the source routing node and the to-be-verified intermediate routing node as a dependency start channel;

determining the first channel in the path between the to-be-verified intermediate routing node and the destination routing node as a dependency end channel; and

adding, to the channel dependency graph of the routing network in which this fault has not occurred, a channel dependency relationship that is from the dependency start channel to the dependency end channel such that the channel dependency graph of the routing network in which this fault has not occurred becomes the updated channel dependency graph.

3. The method according to claim 1 , wherein determining the at least one intermediate routing node that is used to transfer the to-be-transmitted data between the two routing nodes comprises:

obtaining, as a first information set, information about a routing node in a fault-free communication connection to the source routing node of the two routing nodes;

obtaining, as a second information set, information about a routing node in a fault-free communication connection to the destination routing node of the two routing nodes;

calculating an intersection set of the first information set and the second information set; and

determining, as the at least one intermediate routing node, a routing node corresponding to routing node information comprised in the intersection set.

4. The method according to claim 1 , wherein before adding the channel dependency relationship between the to-be-verified intermediate routing node and the two routing nodes to the channel dependency graph of the routing network in which this fault has not occurred in order to enable the channel dependency graph to become the updated channel dependency graph, the method further comprises obtaining, as the channel dependency graph of the routing network in which this fault has not occurred, a channel dependency graph that does not comprise a dependency relationship loop and that is obtained a channel dependency relationship is added at a previous time.

5. The method according to claim 1 , wherein the method further comprises sending description information of the final intermediate routing node to the source routing node of the two routing nodes such that the source routing node sends the to-be-transmitted data to the final intermediate routing node.

6. An apparatus for determining an intermediate routing node, comprising:

a processor; and

a memory coupled to the processor,

wherein the memory has a plurality of instructions stored thereon, that when executed by the processor, cause the processor to:

determine at least one intermediate routing node that is used to transfer to-be-transmitted data between two routing nodes when there is a fault in a communication path between the two routing nodes;

add a channel dependency relationship between a to-be-verified intermediate routing node and the two routing nodes to a channel dependency graph of a routing network in which this fault has not occurred in order to enable the channel dependency graph to become an updated channel dependency graph, wherein the to-be-verified intermediate routing node is any one of the at least one intermediate routing node, wherein the channel dependency relationship is a combination of channels in which the two routing nodes perform data transmission using the to-be-verified intermediate routing node, and wherein the channel dependency graph of the routing network in which this fault has not occurred is used to describe a dependency relationship constituted by any two channels in the routing network in which this fault has not occurred, or a combination of a dependency relationship constituted by any two channels in the routing network in which this fault has not occurred and a channel dependency relationship that is established before the fault; and

determine the to-be-verified intermediate routing node as a final intermediate routing node that is used to transfer the to-be-transmitted data when the updated channel dependency graph does not have a dependency relationship loop,

wherein the dependency relationship loop is a loop constituted by a channel dependency relationship combination.

7. The apparatus according to the claim 6 , wherein the instructions further cause the processor to:

search, according to a transmission direction of the to-be-transmitted data, the channel dependency graph of the routing network in which this fault has not occurred, to find a last channel in a path between a source routing node of the two routing nodes and the to-be-verified intermediate routing node and a first channel in a path between the to-be-verified intermediate routing node and a destination routing node of the two routing nodes;

determine the last channel in the path between the source routing node and the to-be-verified intermediate routing node as a dependency start channel;

determine the first channel in the path between the to-be-verified intermediate routing node and the destination routing node as a dependency end channel; and

add, to the channel dependency graph of the routing network in which this fault has not occurred, a channel dependency relationship that is from the dependency start channel to the dependency end channel such that the channel dependency graph of the routing network in which this fault has not occurred becomes the updated channel dependency graph.

8. The apparatus according to the claim 6 , wherein the instructions further cause the processor to:

obtain, as a first information set, information about a routing node in a fault-free communication connection to the source routing node of the two routing nodes;

obtain, as a second information set, information about a routing node in a fault-free communication connection to the destination routing node of the two routing nodes;

calculate an intersection set of the first information set and the second information set; and

determine, as the at least one intermediate routing node, a routing node corresponding to routing node information comprised in the intersection set.

9. The apparatus according to the claim 6 , wherein the instructions further cause the processor to obtain, as the channel dependency graph of the routing network in which this fault has not occurred, a channel dependency graph that does not comprise a dependency relationship loop and that is obtained a channel dependency relationship is added at a previous time.

10. The apparatus according to the claim 6 , wherein the instructions further cause the processor to send description information of the final intermediate routing node to the source routing node of the two routing nodes such that the source routing node sends the to-be-transmitted data to the final intermediate routing node.