Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Calculation method and device of a multi-path routing tree

A calculation method and routing tree technology, applied in the field of communication, can solve problems such as increased packet loss rate, network congestion, communication interruption, etc., to achieve the effect of avoiding network congestion and improving communication service quality

Active Publication Date: 2021-03-30
SHENZHEN FORWARD IND CO LTD
View PDF13 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in practice, it is found that the use of unicast routing protocol can only calculate a shortest path from the source node to the destination node, which is prone to problems such as network congestion and increased packet loss rate during the peak period of communication network usage. When a local node failure of the network occurs on the shortest path, the communication from the source node to the destination node will be interrupted.

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
  • Calculation method and device of a multi-path routing tree
  • Calculation method and device of a multi-path routing tree
  • Calculation method and device of a multi-path routing tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0058] See figure 1 , figure 1 It is a flow diagram of a method of calculating a multi-path routing tree according to an embodiment of the present invention. Among them, if figure 1 As shown, the calculation method of the multipath routing tree can include the following steps:

[0059] S101, obtain the network topology map of the communication network where the target device is located from the pre-stored link state database.

[0060] In this embodiment, the link state database can be an LSD link status database, which is a database for switching routing information.

[0061] In this embodiment, the network topology map includes a source node and a plurality of destination nodes, and the source node is a network node in the communication network, and the destination node is a different network node which is different from the source node in the communication network.

[0062] In this embodiment, the network topology is also referred to as a network topology, and is a physical l...

Embodiment 2

[0081] See figure 2 , figure 2 It is a flow diagram of a method of calculating a multi-path routing tree according to an embodiment of the present invention. Among them, if figure 2 As shown, the calculation method of the multipath routing tree can include the following steps:

[0082] S201, obtain the network topology map of the communication network where the target device is located from the pre-stored link status database.

[0083] In this embodiment, the network topology map includes a source node and a plurality of destination nodes, and the source node is a network node in the communication network, and the destination node is a different network node which is different from the source node in the communication network.

[0084] S202, based on the network topology, the initial routing tree is constructed by the breadth priority algorithm.

[0085] In this embodiment, the root node of the initial routing tree is the source node.

[0086] S203, traversing all of the leaf nod...

Embodiment 3

[0121] See image 3 , image 3 It is a schematic structural diagram of a computing device of a multi-path routing tree according to an embodiment of the present invention. Among them, if image 3 As shown, the computing device of the multipath routing tree includes:

[0122] Get module 301, for obtaining a network topology diagram of the communication network where the target device is located from the pre-stored link status database, the network topology map includes a source node and a plurality of destination nodes, the source node is the network node of the target device in the communication network. The destination node is a different network node that is different from the source node in the communication network.

[0123] In this embodiment, the network topology map can also include a path opening value between the respective nodes and nodes, and the present embodiment is not limited.

[0124] Building module 302 is used to construct an initial routing tree based on a netwo...

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

A method and device for calculating a multi-path routing tree, comprising: obtaining a network topology diagram of a communication network where a target device is located from a pre-stored link state database; constructing an initial routing tree through a breadth-first traversal algorithm based on the network topology diagram; The preset pruning rules prune the initial routing tree to obtain the pruned routing tree, and build the next level routing tree on the basis of the pruned routing tree based on the network topology diagram to obtain the secondary routing tree; Whether there are new nodes added in the process of obtaining the secondary routing tree in the next routing tree; if not, determine the initial pruning routing tree as the desired multi-path routing tree and store the multi-path routing tree. The calculation method and device for implementing the multi-path routing tree can calculate multiple paths to the destination node, thereby effectively avoiding problems such as network congestion and increased packet loss rate caused by local nodes in the network or communication network usage peaks, thereby improving Communication quality of service.

Description

Technical field [0001] The present invention relates to the field of communication technology, and in particular, a method and apparatus for a multi-path routing tree. Background technique [0002] The path calculation method of existing network routing is often used by unicast routing protocols to calculate the routing path. Specifically, a shortest path from the source node to the destination node is calculated according to a pre-conventional rule (such as the minimum hop tree, the lowest price, etc.). However, in practice, it is found that the unicast routing protocol can only calculate a shortest path from the source node to the destination node. The use of network congestion, packet loss rate increases during the communication network, and when it is When a network partial node fault occurs on the shortest path, it can cause communication interruption from the source node to the destination node. Inventive content [0003] In view of the above problems, the present inventio...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/753H04L12/751H04L12/801H04L45/02
CPCH04L45/02H04L45/48H04L47/12
Inventor 段文韬李振华赵荣方
Owner SHENZHEN FORWARD IND CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products