Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Optimum path selection method of communication network based on load balance

An optimal path and load balancing technology, applied in the field of communication, can solve problems such as cost increase and complex configuration of each node, and achieve the effect of overall load balancing, increasing complexity, and reducing blocking rate

Inactive Publication Date: 2009-07-29
ZTE CORP
View PDF0 Cites 28 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the optional routing algorithm provides several routes to be selected, when a business occurs, the appropriate route is selected randomly or through other criteria. The most prominent problem brought by this algorithm is that the configuration of each node in the system is more complicated. , the cost of solving the problem is greatly increased

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Optimum path selection method of communication network based on load balance
  • Optimum path selection method of communication network based on load balance
  • Optimum path selection method of communication network based on load balance

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0042] In order to take into account the short path and load balance, when selecting the optimal path, the top-level network element manager who knows the entire network topology first uses the traditional shortest path algorithm to obtain several short paths, and selects a path with a smaller load as the optimal path. path. First, using the existing shortest path algorithm, the information of the shortest path and the second shortest path between nodes is obtained by using certain criteria that network users care about as weights (such as path length, the sum of the loads of nodes on the path, etc.); then, According to some improved heuristic algorithm, update and process the node information on the shortest path and the second shortest path with the same specific criterion and method, and select a path as the new shortest path.

[0043] Taking the Floyd algorithm as an example, the method of calculating the optimal path includes the following steps:

[0044] Step 101, utili...

no. 2 example

[0113] Taking the Dijkstra algorithm as an example, the idea of ​​this embodiment is different from that of the first embodiment. Instead of selecting two paths, the weights are directly brought in when selecting the shortest path, and the calculated shortest path is the optimal path.

[0114] Use the Dijkstra algorithm to calculate the shortest path. When a link (node) is selected as the optimal path between two nodes, its weight is correspondingly increased according to factors such as path length and load, so that according to the algorithm result, the link (nodes) are less likely to continue to be selected as default routes by other paths. Traverse to find all the optimal paths in the network.

[0115] In this embodiment, such as flow image 3 As shown, when a shortest path is selected as the optimal path, its length is artificially increased (m[u][j]++), so that when the next selection is made, this path is selected as the shortest path The chances of passing will be re...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an optimal path selection method based on the load balance in a communication network, which can balance the load at each node among networks and reduce the network blocking rate. The method includes the following steps: when selecting an optimal path, a top-level network element manager knowing an entire network topology utilizes the existing shortest path algorithm to obtain a plurality of short paths, selects one path with small load or short path as the optimal path, or utilizes the existing shortest path algorithm to calculate and determine a certain shortest path as the optimal path, then increases weights of the determined optimal path according to the path length or load factor, calculates the shortest path among other nodes according to the path weights, and then takes the obtained shortest path as the optimal path.

Description

technical field [0001] The invention relates to the communication field, in particular to a method for finding an optimal path in a network. Background technique [0002] Such as figure 1 In the shown network topology, generally speaking, the optimal path selection in the network is the most suitable inter-node routing path selected with the weight of path length or other path parameters. If the path length is used as the weight, the shortest path between nodes obtained by Dijstra algorithm or Floyd algorithm is generally the optimal path. However, the traditional single-path algorithm often only selects the shortest path between nodes, but does not pay attention to the balance of the passing load on each node (and link). Facts have proved that the load balance between nodes has a great influence on the network blocking rate. Although the optional routing algorithm provides several routes to be selected, when a business occurs, the appropriate route is selected randomly o...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/56H04L12/701H04L12/803
Inventor 徐昊
Owner ZTE CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com