Loop-Free Routing Arcs for Multicast Traffic Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols face challenges in quickly responding to link failures without introducing loops in the network, leading to data traffic loss due to the need for route recalculation, as seen in 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, where each arc has two ends and a junction node with reversible links, allowing for instantaneous rerouting without loops by reversing identified reversible links, ensuring reachability to a destination node even if one link fails.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If route recalculation is performed in response to detected failure, then routing correctness is maintained, but data traffic loss occurs due to computation time
Solution Approach 1:
The patent pre-calculates and stores multiple loop-free paths (primary and alternate paths) to destinations before failures occur. When a link failure is detected, routers can immediately switch to pre-computed alternate paths without performing recalculation, thus eliminating computation time delays while maintaining routing correctness.
Solution Approach 2:
The patent extracts and isolates the path calculation process from the failure response process. By pre-computing and storing alternate paths separately before failures occur, the system separates the computationally intensive pathfinding operation from the time-critical failure recovery operation, allowing immediate response to failures.
2Speed
If LFA identifies feasible successor without loop creation, then response speed to failure is improved, but coverage is limited to specific network nodes
Solution Approach 1:
The patent dynamically determines path selection based on the specific failure scenario and network topology. Instead of using fixed alternate paths, the system adapts path selection to the actual failure location and type, enabling LFA-like immediate response while extending coverage to network configurations where traditional LFA would fail.
Solution Approach 2:
The patent creates a universal path computation mechanism that works across diverse network topologies and failure scenarios. The system provides alternate paths for all network nodes, not just those covered by traditional LFA, making the solution applicable to a broader range of routing situations including mesh networks and complex topologies.
3Reliability
If multiple paths are provided to multicast listeners, then traffic redundancy is improved, but loop formation risk increases
Solution Approach 1:
The patent inverts the traditional approach by constructing paths from the destination (multicast listener) backward to the source, rather than forwarding from source to destination. This reverse path construction, combined with directed acyclic graph techniques, ensures that multiple paths are inherently loop-free while providing redundancy for multicast traffic delivery.
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 multicast listeners from a multicast source, 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 receiving from each of the first and second network devices a copy of a multicast packet originated from the multicast source; and causing the multicast packet to be propagated throughout the loop-free routing topology based on the first and second ends of each routing arc forwarding the corresponding copy into the corresponding routing arc.