Bidirectional Transmission Path Selection for Consistent SR Tunnels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mobile backhaul transport networks face the challenge of ensuring that transmission paths in opposite directions between two nodes are the same to maintain two-way transmission consistency and improve system performance.
Innovation Solution
A method and apparatus that determine transmission paths by using node IDs and port numbers to compute candidate paths, ensuring that paths in both directions are consistent by selecting paths with the same costs and reversing paths as necessary to align them, thereby ensuring that paths in both directions are the same.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a shortest path algorithm is used to compute transmission paths in an SR tunnel, then path computation efficiency is improved, but path consistency between opposite directions cannot be ensured
Solution Approach 1:
The patent applies asymmetry by designating one direction (from smaller node ID to larger node ID) as the forward direction and the opposite direction as the backward direction. This asymmetric designation ensures that both directions use the same computed path while maintaining efficient shortest path computation. The source node is determined by comparing node IDs, creating a consistent asymmetric reference frame for bidirectional path selection.
Solution Approach 2:
The patent makes the path computation universal by having both source and destination nodes perform the same path computation function. Instead of having different nodes compute different paths, both nodes use the same shortest path algorithm with the same parameters (source node ID, destination node ID, and port numbers) to derive the identical path, ensuring consistency while maintaining computational efficiency.
2Reliability
If path consistency is ensured by using symmetric path computation, then two-way transmission consistency is improved, but path computation complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-determining the source node through node ID comparison before path computation. By establishing which node is the source (smaller ID) and which is the destination (larger ID) in advance, the system avoids the need for complex bidirectional path verification during actual transmission, simplifying the computation while ensuring consistency.
Solution Approach 2:
The patent inverts the traditional approach by having both nodes compute paths using the same source and destination parameters rather than each node computing from its own perspective. The destination node computes the path as if it were the source, using the same algorithm and parameters, which simplifies the complexity while ensuring both nodes arrive at the identical path.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Embodiments of this application relate to the communications field, and disclose a transmission path determining method and node, to resolve a problem that a transmission path from a source node to a destination node is different from a transmission path from the destination node to the source node. A specific solution is as follows: A first node determines a first candidate path group; when the first candidate path group includes at least two first candidate paths, selects a first path from at least one first candidate path according to a preset first rule based on node information of all first candidate paths included in the first candidate path group; and when a source node of the first path is the first node, determines that the first path is a transmission path; or when a source node of the first path is a second node, determines that a second path is a transmission path, where the second path is a reverse path of the first path.