Fat-Tree Routing Path Computation for Network Topology
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Balancing routing paths in odd-fat tree network topologies is challenging due to the lower number of disjoint paths, which affects the efficiency and reliability of data transmission in fat-tree networks.
Innovation Solution
A method and device for determining the type of computational grid topology, specifically identifying if it is a fat-tree, and then computing balanced routing paths using a topology-agnostic routing technique to configure forwarding tables in switches, ensuring balanced primary and redundant paths across the network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If traditional routing topology is used in fat-tree networks, then the network structure is simpler, but the number of disjoint paths is reduced and routing balance is compromised
Solution Approach 1:
The patent implements dynamic routing path computation that adapts to the specific fat-tree topology characteristics (odd vs even, regular vs irregular). The system dynamically determines the topology type and selects appropriate routing algorithms to compute balanced primary and redundant paths, ensuring optimal routing balance without requiring a fixed complex topology structure.
Solution Approach 2:
The patent changes the routing parameters based on the detected topology characteristics. By identifying whether the fat-tree is odd or even and regular or irregular, the system adjusts the routing path computation parameters to achieve balanced load distribution across available paths, resolving the contradiction between structural simplicity and routing balance.
2Reliability
If topology-specific routing is implemented for odd-fat trees, then routing balance is improved, but the system complexity increases
Solution Approach 1:
The patent segments the routing computation process into distinct phases: topology identification (detecting odd/even and regular/irregular characteristics), conditional algorithm selection, and path computation. This segmentation allows the system to handle different fat-tree variants with specialized algorithms while maintaining a unified overall framework, reducing the perceived complexity.
Solution Approach 2:
The patent creates a universal routing system that can handle multiple fat-tree variants (odd, even, regular, irregular) through a single integrated architecture. The system uses topology detection to automatically adapt to the specific variant and apply the appropriate routing algorithm, eliminating the need for separate dedicated systems for each topology type.
3Reliability
If routing paths are computed dynamically, then fault tolerance is improved, but the computation time increases
Solution Approach 1:
The patent performs preliminary topology identification and routing path computation during network initialization or configuration phases. By pre-computing balanced primary and redundant paths based on the detected topology characteristics, the system minimizes real-time computation requirements when faults occur, enabling rapid fault response without significant computation time penalty.
Solution Approach 2:
The routing system automatically detects topology characteristics and selects appropriate routing algorithms without external intervention. This self-service capability eliminates the need for manual configuration and reduces computation time by immediately applying the optimal algorithm for the detected topology type when faults are detected.
Data Source
AI summary
A device and method for providing balanced routing paths in a computational grid including determining a type of topology of the computational grid having a plurality of levels, wherein each level includes a plurality of switches, determining whether the type of topology of the computational grid is a fat-tree, determining whether the fat-tree is odd, determining whether the fat-tree is a regular fat-tree, computing a first set of routing paths for the computational grid based on the determining of whether the fat-tree is odd and is a regular fat-tree, computing a second set of routing paths for the computational grid using a topology agnostic routing technique, and configuring forwarding tables in said switches with the first set of computed routing paths when the topology is determined to be a fat-tree and with the second set of computed routing paths when the topology is determined to not be a fat-tree.