Adaptive Routing in Destination-Routed Switch Fabric
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Static routing techniques fail to adapt to network changes, leading to transmission failures when links go down, while dynamic routing adds complexity and takes time to establish alternative routes, causing delays in network adjustments.
Innovation Solution
A method for determining and updating routing information in network components using cost-based adoption rules, allowing for adaptive routing decisions based on dynamic inputs and multiple sets of routing information stored in routing tables, ensuring fault tolerance and efficient path selection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If static routing techniques are used, then routing simplicity is maintained, but transmission reliability deteriorates when links go down
Solution Approach 1:
The patent pre-calculates and stores multiple alternative routes in routing tables before network changes occur. When a link failure is detected, switches can immediately switch to pre-computed alternative routes without performing complex real-time calculations, thus maintaining both simplicity and reliability.
Solution Approach 2:
The patent changes the routing parameter from a single fixed route to multiple alternative routes with different costs. By maintaining several route options with varying cost parameters in the routing tables, the system can quickly adapt to link failures by selecting alternative routes without increasing operational complexity.
2Adaptability or versatility
If dynamic routing techniques are used, then adaptability to network changes is improved, but routing complexity and processing time increase
Solution Approach 1:
The patent pre-calculates multiple alternative routes and stores them in routing tables before network changes occur. This eliminates the need for complex real-time route calculations when failures occur, as all alternative paths are already determined and stored with their associated costs.
Solution Approach 2:
The patent implements dynamic route selection by allowing switches to choose from multiple pre-calculated routes based on current network conditions. The routing tables contain multiple alternative paths with different costs, enabling dynamic adaptation to link failures without requiring complex real-time recalculation algorithms.
3Adaptability or versatility
If dynamic routing recalculation is performed, then route adaptability is improved, but transmission delay increases during the selection process
Solution Approach 1:
The patent pre-calculates and stores multiple alternative routes with their costs in routing tables before any link failures occur. When a failure is detected, switches can immediately select from the pre-computed alternative routes without performing time-consuming real-time calculations, thus eliminating route selection delay.
Solution Approach 2:
The patent allows switches to skip the complex real-time route recalculation process by using pre-computed alternative routes that are already stored in the routing tables. This enables immediate switching to alternative paths when link failures occur, bypassing the time-consuming calculation phase entirely.
Data Source
AI summary
Described are techniques for determining a set of routing information for a plurality of components performing routing in a network. Destinations that are directly connected to each of the plurality of components are determined. Each of the plurality of components is associated with one of a plurality of routing tables. Each of the plurality of routing tables stores routing information in accordance with destinations in the network. Cost information is stored in the plurality of routing tables for each destination directly connected to one of the plurality of components. For each of the plurality of components, a set of neighboring components is determined. For each neighboring component, routing information for a destination is adopted from the routing table of said each neighboring component in accordance with an adoption rule. Processing is repeatedly performed until the routing tables have not been modified.