Recorded Route Bit Strings for Communication Network Loop Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication networks face challenges in efficiently detecting and preventing loops, particularly micro-loops and macro-loops, which can occur due to transient or permanent conditions such as network convergence and faulty node behavior, leading to inefficient packet forwarding.
Innovation Solution
Incorporating a recorded route bit string within packets to detect loops by indicating traversed nodes, allowing nodes to determine if a packet has previously traversed them, and initiating actions to prevent further looping based on this information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a recorded route bit string is added to packets for loop detection, then loop detection capability is improved, but packet header complexity increases
Solution Approach 1:
The recorded route header is nested within or adjacent to the native protocol header structure. The patent shows the recorded route header being integrated into existing packet formats (Ethernet, IP, MPLS) by placing it within or next to the native header, utilizing the existing header space efficiently rather than adding a completely separate structure.
Solution Approach 2:
The recorded route header is designed to be protocol-agnostic and can be applied across multiple network protocols (Layer 2 Ethernet, Layer 3 IP, Layer 2.5 MPLS). The same bit string mechanism works universally across different protocol types, making the loop detection capability multi-functional and adaptable to various network environments.
2Adaptability or versatility
If loop detection is implemented across all network protocols, then versatility is improved, but implementation complexity increases
Solution Approach 1:
The recorded route header uses a universal bit string format that can be applied across multiple network protocols including Ethernet (Layer 2), IP (Layer 3), and MPLS (Layer 2.5). The same detection mechanism works for all these protocols without requiring protocol-specific implementations, achieving multi-functionality.
Solution Approach 2:
The patent applies different specific implementations of the recorded route header tailored to each protocol type. For Ethernet, it uses a specific format; for IP, it integrates with IP options; for MPLS, it uses label stacking. Each protocol gets a locally optimized implementation while maintaining the same core functionality.
3Productivity
If the recorded route header is placed within the native header, then packet structure efficiency is improved, but header processing complexity increases
Solution Approach 1:
The recorded route header is nested within the native protocol header structure. The patent shows configurations where the recorded route header is placed inside the Ethernet header, IP header, or MPLS label stack, utilizing the existing header space and maintaining a compact packet structure.
Solution Approach 2:
The patent introduces an intermediary Ethertype field or protocol field that mediates between the native header and the recorded route header. This intermediary element allows the recorded route header to be integrated seamlessly into the packet structure while maintaining clear delimitation and processing boundaries.
Data Source
AI summary
Various example embodiments for supporting loop detection in a communication network are presented. Various example embodiments for supporting loop detection in a communication network may be configured to support loop detection based on use of a recorded route bit string which may be inserted within packets for enabling detection of loops as the packets are communicated over the communication network. Various example embodiments for supporting loop detection in a communication network may be configured to support loop detection for a packet based on inclusion within the packet of a recorded route bit string having bit positions corresponding to nodes of the communication network where the bit positions may be set in a manner indicative of the nodes which have been traversed by the packet.