Method for implementing multiple next hopping routers, device and system thereof
A routing and algorithm technology, applied in transmission systems, digital transmission systems, electrical components, etc., can solve problems such as unbalanced network traffic and low utilization of network resources, and achieve the effect of avoiding loops and solving unbalanced network traffic
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0024] A spanning tree refers to a tree that connects all nodes in a graph. It is an important concept in graph theory and the basis of many important algorithms in graph theory and network communication. Based on the spanning tree theory, the present invention proposes a brand-new routing algorithm——Spanning Tree Number Potential Algorithm (STNPA), according to which STNPA can realize a multi-next-hop routing scheme, which specifically includes network node sequencing and multi-next-hop route generation in two steps.
[0025] In the process of network node sequencing, each network exit uses a centralized calculation method to run a specific support tree search algorithm with itself as the root to obtain a support tree in the network, which is given to the network during the operation process. The order of each node in . Currently available spanning tree search algorithms include Breadth First Search (BFS), Depth First Search (DFS), Shortest Path Tree Search (Dijkstra), Minim...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 