Intermediate Routing Node Determination via Channel Dependency Graph
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing networks face inefficiencies in resource utilization due to the need for multiple virtual channels to prevent routing deadlocks, leading to wasted resources and unbalanced utilization, especially when only a few intermediate routing nodes are required to bypass faults.
Innovation Solution
A method to determine an intermediate routing node that does not create a dependency relationship loop in the channel dependency graph, allowing data to be transferred using a single intermediate node without requiring multiple virtual channels to be idle and ready, by adding channel dependency relationships to the graph and verifying for loops.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple virtual channels are reserved to prevent routing deadlocks, then routing reliability is improved, but network resource utilization deteriorates
Solution Approach 1:
The patent performs preliminary verification of the channel dependency graph before selecting an intermediate routing node. By checking whether adding a candidate node would create a dependency loop in advance, the system avoids selecting nodes that would cause routing deadlocks, eliminating the need for multiple pre-reserved virtual channels while maintaining routing reliability.
2Reliability
If n+1 virtual channels are reserved for n intermediate routing nodes, then fault tolerance is improved, but resource waste increases
Solution Approach 1:
The patent extracts and removes the redundant virtual channel reservation mechanism from the fault-tolerant routing system. By using channel dependency graph verification to directly identify safe intermediate nodes, the system eliminates the unnecessary n+1 virtual channel reservation requirement, reducing resource waste while maintaining fault tolerance capabilities.
3Reliability
If virtual channel method is used to prevent routing deadlocks, then routing safety is improved, but system performance deteriorates
Solution Approach 1:
The patent changes the fundamental parameter of deadlock prevention from resource reservation (multiple virtual channels) to graph-based verification (channel dependency graph). This parameter change allows the system to maintain routing safety through logical verification rather than physical resource duplication, thereby improving system performance.
Data Source
Figure 1~3
Figure 4A~5
Figure 6~8
AI summary
The present invention discloses a method for determining an intermediate routing node, including: when there is a fault in a communication path between two routing nodes, determining at least one intermediate routing node that is used to transfer to-be-transmitted data 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, to enable the channel dependency graph to become an updated channel dependency graph; when the updated channel dependency graph does not have a dependency relationship loop, determining the to-be-verified intermediate routing node as a final intermediate routing node that is used to transfer the to-be-transmitted data. According to the method provided in embodiments of the present invention, an intermediate routing node that does not have a dependency relationship loop in a channel dependency graph may be determined, and when a communication fault occurs between two routing nodes, to-be-transmitted data may be transferred by using only one intermediate routing node, which improves resource utilization of a routing network.