Segment Routing Loop Detection via Interface Consistency Checks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Temporary loops occur in segment routing networks due to performance differences between network nodes during link failures or recoveries, leading to issues like port congestion and service packet loss.
Innovation Solution
A loop detection method that determines whether an interface for receiving a packet is consistent with the outbound interface for forwarding, allowing timely adjustment of forwarding operations to avoid loops by discarding or rerouting packets through backup paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If segment routing is implemented with dynamic path calculation, then network adaptability and backup path availability are improved, but temporary loops occur due to performance differences between nodes during convergence
Solution Approach 1:
The patent applies preliminary action by pre-calculating and pre-distributing loop detection information (such as detected loop flags or interface consistency data) to network nodes before actual packet forwarding occurs. This allows nodes to have advance knowledge of potential loop conditions, enabling them to make correct forwarding decisions without waiting for real-time detection, thus preventing temporary loops during convergence while maintaining dynamic adaptability
Solution Approach 2:
The patent implements feedback mechanisms where network nodes continuously monitor forwarding path consistency and report loop conditions back to the control plane or adjacent nodes. This feedback loop enables dynamic adjustment of routing decisions, allowing the network to maintain adaptability while automatically correcting loop conditions that arise during convergence, thereby preserving forwarding reliability
2Measurement precision
If loop detection is performed by comparing interface consistency, then loop detection accuracy is improved, but additional processing time and complexity are introduced
Solution Approach 1:
The patent extracts the loop detection function from complex end-to-end path analysis and implements it as a simple local interface consistency check at each network node. By taking out the detection logic from global routing calculations and placing it at the local forwarding level, the patent achieves high detection accuracy through interface comparison while significantly reducing device complexity and processing overhead
Solution Approach 2:
The patent enables self-service loop detection where each network node independently performs interface consistency checks on its own incoming and outgoing interfaces without requiring external assistance or complex coordination. This self-service approach allows accurate local loop detection while minimizing device complexity, as each node handles its own detection needs using readily available interface information
3Reliability
If packets are discarded upon loop detection, then service packet loss is prevented, but network throughput and productivity are reduced
Solution Approach 1:
The patent applies segmentation by dividing the network forwarding path into segments and implementing loop detection at specific segmentation points (interfaces). When a loop is detected in one segment, only packets in that specific segment are discarded or rerouted, while other segments continue normal forwarding. This selective approach prevents service packet loss in affected areas while maintaining network throughput in unaffected areas, resolving the contradiction between reliability and productivity
Data Source
AI summary
A loop detection method and apparatus are provided. The method includes: A first node receives a packet from a second node through a first interface. A node segment identifier is encapsulated at an outer layer of the packet. The node segment identifier identifies a destination node. The first node determines, based on the node segment identifier, that an outbound interface for forwarding the packet is the first interface. The first node determines that a loop exists in a forwarding path of the packet. Whether the loop exists in the forwarding path of the packet is determined by determining whether an interface through which the first node receives the packet is consistent with an outbound interface through which the first node forwards the packet, to further adjust the forwarding path of the packet when the loop exists in the forwarding path of the packet, for example, forward the packet along a backup path or discard the packet, to avoid problems such as port congestion and service packet loss.