Loop-Free Routing Topology Using Reversible Arcs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols face challenges in rapidly rerouting network traffic without introducing loops when a link failure occurs, leading to data traffic loss due to the need for route recalculation, as seen in approaches like Loop Free Alternates (LFA) and Fast Local Rerouting for Handling Transient Link Failures (FIR).
Innovation Solution
A loop-free routing topology is created using routing arcs with reversible links, allowing network traffic to be rerouted instantly upon link failure without forming loops, by identifying reversible links and reversing them within the routing arcs, ensuring any network device with two data links can reach a destination via non-congruent paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If route recalculation is performed in response to link failure, then routing can adapt to changes, but data traffic loss occurs due to computation time
Solution Approach 1:
The patent pre-establishes a loop-free routing topology using routing arcs before any link failure occurs. Each network device maintains pre-computed alternate paths (routing arcs) that can be immediately activated upon failure detection, eliminating the need for post-failure route recalculation and thus preventing data traffic loss while maintaining adaptability.
2Productivity
If LFA identifies feasible successors, then some nodes can achieve fast rerouting, but many nodes remain unsolvable and cannot provide routing solutions
Solution Approach 1:
The patent creates a universal loop-free routing topology using routing arcs that can be applied to any network device with two or more data links, regardless of node position or topology characteristics. This universal approach ensures that all nodes (not just selected ones) can achieve fast rerouting capability, making the solution applicable to diverse network configurations including those where LFA fails.
3Reliability
If U-turn protocol reverses a link, then some link failures can be handled, but nodes P, R1, and R2 still cannot be solved in event of link failure
Solution Approach 1:
The patent segments the routing path into directed routing arcs with clearly defined start and end points. Each routing arc represents a unidirectional path segment that can be independently activated. This segmentation allows the system to provide targeted alternate paths for specific nodes (including P, R1, and R2) by selecting and activating appropriate routing arcs, rather than relying on universal link reversal that fails for certain node configurations.
4Speed
If routing arcs with reversible links are created, then instantaneous rerouting is enabled without loops, but topology complexity increases
Solution Approach 1:
The loop-free routing topology using routing arcs is pre-established during normal operation before any failure occurs. The directed arcs and their metadata (start/end points, directionality) are computed and stored in advance, allowing instantaneous activation upon failure without requiring complex real-time calculations or dynamic topology reconfiguration, thus achieving fast rerouting without proportionally increasing operational complexity.
Data Source
AI summary
In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device.