Loop-Free Routing Topology with Non-Congruent Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols in computing networks, such as IP networks, are not well-suited for bicasting applications as they incur data traffic loss due to computation time required for route recalculation in response to link or node failures, and fail to provide solutions for certain network nodes in case of link failures.
Innovation Solution
A loop-free routing topology is created using non-congruent routing arcs that allow for instantaneous rerouting of network traffic without introducing loops, utilizing reversible links to ensure reachability to a destination node even in case of failures, and enabling bicasting and multicasting through distinct paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing routing protocols recalculate routes in response to detected failures, then route correctness is maintained, but computation time causes data traffic loss
Solution Approach 1:
The patent pre-calculates and stores multiple loop-free paths (primary and alternate paths) to destination nodes before failures occur. When a failure is detected, the router can immediately switch to a pre-computed alternate path without performing recalculation, thus maintaining route correctness while eliminating computation time and associated data traffic loss.
Solution Approach 2:
The patent prepares backup routing paths in advance as a cushion against potential failures. These pre-computed alternate paths act as a safety buffer that can be activated immediately when failures occur, preventing the need for time-consuming route recalculation and ensuring continuous data traffic flow.
2Reliability
If LFA identifies feasible successors avoiding loops, then loop-free rerouting is achieved for some nodes, but no solutions are provided for certain network nodes (N3, S, P, R1, R2)
Solution Approach 1:
The patent creates a universal routing solution that works for all network nodes by establishing a hierarchical structure where each node can identify at least one loop-free path to every destination. The method uses a combination of primary paths (from shortest path tree) and alternate paths (from reversed links) that can be applied universally across the entire network topology, not just for specific nodes.
Solution Approach 2:
The patent introduces a new dimension to routing by creating bidirectional routing arcs where traffic can flow in either direction along the same physical link. This is achieved by establishing alternate paths that reverse link directions, providing additional routing dimensions that enable loop-free paths for nodes that LFA cannot serve.
3Reliability
If U-turn protocol reverses links for rerouting, then some link failures are addressed, but no solutions are provided for nodes P, R1, or R2
Solution Approach 1:
The patent merges the concepts of LFA (local repair algorithm) and U-turn protocol into a unified routing architecture. It combines the pre-computed alternate paths from LFA with the link reversal mechanism of U-turn protocol, creating a hybrid solution that leverages the strengths of both approaches to provide comprehensive coverage for all node types and failure scenarios.
Solution Approach 2:
The patent creates a composite routing solution that integrates multiple routing strategies (shortest path tree, reversed link paths, and hierarchical path selection) into a single unified routing table. This composite approach combines different path types and selection criteria to provide robust failure recovery for all network nodes, including those that individual methods cannot handle.
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 network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.