Forwarding Path Recovery Across Logical Topology Changes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing SR technology struggles to generate a forwarding path when the logical topology changes, causing interruptions in physical links between network nodes, which hinders communication.
Innovation Solution
A method and apparatus that generate a forwarding path by obtaining topology information of network nodes supporting a target path calculation algorithm, determining a second forwarding path when interruptions occur, and updating next hop devices to ensure communication through nodes that do not support the target algorithm, using techniques like path calculation and segment identifiers to maintain connectivity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If path calculation is performed based only on network nodes supporting the target path calculation algorithm, then the forwarding path follows the logical topology, but when logical topology changes, physical links between network nodes are interrupted and communication cannot be maintained
Solution Approach 1:
The patent introduces second network nodes as intermediary elements that do not support the target path calculation algorithm but serve as bridges to maintain physical connectivity. These intermediary nodes allow the forwarding path to traverse through network nodes that would otherwise be excluded from the logical topology, thus maintaining communication when logical topology changes occur.
Solution Approach 2:
The patent segments the forwarding path into multiple sub-paths: first forwarding sub-paths that follow the logical topology through network nodes supporting the target algorithm, and second forwarding sub-paths that traverse through network nodes not supporting the target algorithm. This segmentation allows each segment to be optimized for its specific function while maintaining overall path integrity.
2Ease of operation
If the forwarding path is strictly confined to network nodes in the same logical topology, then path calculation is simplified, but the path cannot adapt when logical topology changes cause link interruptions
Solution Approach 1:
The patent implements a dynamic path calculation approach where the system first attempts to calculate paths using only network nodes supporting the target algorithm (simple mode), and when link interruptions are detected, automatically transitions to a more complex calculation mode that includes network nodes not supporting the target algorithm. This dynamic adaptation maintains ease of operation under normal conditions while ensuring reliability when topology changes occur.
3Stability of the object's composition
If network nodes that do not support the target path calculation algorithm are excluded from path calculation, then the forwarding path maintains algorithm consistency, but communication is interrupted when logical topology changes
Solution Approach 1:
The patent applies partial action by selectively including or excluding network nodes based on their algorithm support status. Under normal conditions, only network nodes supporting the target algorithm are included to maintain algorithm consistency. When link interruptions occur, the system excessively includes additional network nodes (those not supporting the target algorithm) to restore communication, accepting temporary algorithm inconsistency for the sake of communication continuity.
Data Source
AI summary
Method and apparatus for generating a forwarding path, network device and storage medium. Method comprises: obtaining topology information of first network nodes supporting a target path calculation algorithm; performing, using the target path calculation algorithm, path calculation based on the topology information of first network nodes to generate a first forwarding path; obtaining a second forwarding path from the source node to the tail node when there is a path interruption in the first forwarding path; determining, from the second forwarding path, first network nodes communicated with second network nodes obtaining node pairs; updating a next hop device of the first node in each node pair on the second forwarding path as the second node in the node pair obtaining a forwarding path communicated from the source node to the tail node. Second node is located behind first node in each node pair in a direction of second forwarding path.