Network Server Load Balancing Routing Method
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network load balancing routing methods, such as min-hop and widest shortest path algorithms, fail to consider bandwidth and load effectively, leading to suboptimal routing results in network systems.
Innovation Solution
A dynamic load balancing routing method that calculates link criticalities and expected loads based on network topology and bandwidth demands, then selects better transmission paths using a weighted sum of cost values incorporating residual capacities and other factors to efficiently manage network traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If min-hop algorithm is used to select transmission path, then the routing is simple and fast, but the bandwidth and load are not considered leading to suboptimal routing results
Solution Approach 1:
The patent transforms the routing selection from a simple hop-count metric to a multi-parameter optimization problem. It introduces link criticality calculation based on bandwidth demands and loads, then uses cost values that combine residual capacities and expected loads. This parameter transformation enables the system to consider both bandwidth and load while maintaining computational feasibility through the shortest path algorithm framework.
2Length of moving object
If widest shortest path algorithm is used to select transmission path, then the shortest path is selected first, but the bandwidth demands and loads of the shortest paths cannot be both taken into consideration
Solution Approach 1:
The patent merges multiple routing criteria (path length, bandwidth, load) into a single unified cost metric. By calculating link criticalities based on bandwidth demands and loads, then combining these with residual capacities to form cost values, the algorithm integrates all three factors into one comprehensive evaluation measure. This allows the shortest path algorithm to simultaneously optimize for all parameters rather than prioritizing path length alone.
3Device complexity
If conventional routing methods are used, then the calculation is straightforward, but the transmission paths do not balance bandwidth demands and loads effectively
Solution Approach 1:
The patent performs preliminary calculations of link criticalities and expected loads before the actual routing selection. By pre-computing these parameters based on bandwidth demands and network topology, the system prepares optimized cost values that can be directly used in the shortest path algorithm. This preliminary action separates the complex multi-parameter optimization from the real-time routing decision, maintaining computational efficiency while achieving optimal paths.
Data Source
AI summary
A load balancing routing method for networks is disclosed. The routing method includes following steps. A network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs are received by a network server. A plurality of link criticalities of a plurality of links established according to the source-destination pairs is calculated by the network server according to the network topology graph and the expected bandwidth demands. A plurality of expected loads of the links is calculated by the network server according to the link criticalities. A plurality of cost values is calculated according to a plurality of residual capacities of the links and the corresponding expected loads. A better transmission path corresponding to each of the source-destination pairs is selected by the network server according to the weighted sum of the cost values corresponding to the links in the source-destination pair.