Network Routing Path Selection Using Dynamic Link Weights
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network routing solutions are complex and inefficient, failing to achieve balanced load distribution among all links in the network, leading to uneven traffic distribution and increased service risk.
Innovation Solution
A network routing method that calculates the average utilization rate of all links and sets balanced weights for each link based on its bandwidth utilization rate and the network's average utilization rate, using the Dijkstra algorithm to select the path with the minimum accumulated load for service distribution.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If the minimum weight path is obtained by accumulating link weights configured by a network manager based on the Dijkstra algorithm, then the path calculation is simple, but the network traffic distribution becomes unbalanced and some links bear excessive services
Solution Approach 1:
The patent applies dynamics by making the link weight dynamic instead of static. The link weight is calculated in real-time based on the current bandwidth utilization rate of each link. When a link's utilization rate is high, its weight increases, making it less likely to be selected for new services. This dynamic adjustment mechanism continuously adapts to changing network conditions, automatically balancing traffic distribution without complex manual configuration while preventing any single link from bearing excessive services.
2Device complexity
If the only factor taken into consideration is to reduce the hops to the least, then the path selection is simple, but the network traffic distribution becomes unbalanced
Solution Approach 1:
The patent applies parameter changes by transforming the path selection criterion from a single parameter (number of hops) to a composite parameter (accumulated link weights based on bandwidth utilization). Instead of simply counting hops, the system calculates a weight for each link considering its current bandwidth utilization rate, then accumulates these weights along potential paths. This parameter transformation maintains relatively simple algorithmic complexity while achieving balanced traffic distribution, as the weight calculation is straightforward and the path selection process remains efficient.
3Reliability
If a load index is introduced to select an optimal path from multiple non-intersected paths, then the bandwidth of the whole path is considered, but the algorithm complexity increases and efficiency decreases
Solution Approach 1:
The patent applies the taking out principle by extracting the essential factor for load balancing (bandwidth utilization rate) from the complex scenario of evaluating multiple non-intersected paths with load indices. Instead of introducing complex load index calculations and executing the Dijkstra algorithm multiple times to calculate non-intersected paths, the system extracts the key metric (bandwidth utilization rate) and uses it to dynamically adjust link weights. This extraction approach considers the bandwidth of the whole path through accumulated link weights while maintaining high algorithmic efficiency, avoiding the need for multiple algorithm executions and complex path intersection analysis.
Data Source
Figure 1
Figure 2~3
Figure 4
AI summary
The present invention discloses a network routing method and apparatus. In the network routing method, for multiple selectable paths corresponding to current service, an average utilization rate of links of a whole network is calculated according to a bandwidth utilization rate of each link before bearing the current service and the number of the links in the whole network, wherein each of the selectable paths includes at least one link; for each link in each of the selectable paths, a bandwidth utilization rate of each link after bearing the current service is calculated; for each link in each of the selectable paths, a link balanced weight for each link is set according to the bandwidth utilization rate of said link after bearing the current service and the average utilization rate of the links of the whole network; and the link balanced weight of each link included in each of the selectable paths is accumulated respectively to obtain accumulated loads, and a path with the minimum accumulated load is selected as a bearing path for bearing the current service. The technical solution according to the present invention can improve the efficiency and realize the balanced load among the links of the whole network.