Dijkstra route optimization method and device realized based on special attributes of path nodes
By setting special attributes for the path nodes with permission graphs in video conferences and selecting nodes that meet the attribute requirements as the route, the existing Dijkstra routing method has solved the problem of path planning in video conferences, and more efficient path optimization is achieved.
Patent Information
- Application Number
- CN202411754046.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-29
- Publication Date
- 2025-02-28
AI Technical Summary
In video conferencing, the existing Dijkstra routing method is difficult to effectively plan the shortest path in the authorized graph, especially when media control units need to transfer through specific nodes, the existing node cascade score cannot be changed, resulting in difficulty in path planning.
By setting special attributes for path nodes in the permissioned graph, classifying the resource pool attributes, adaptively selecting appropriate paths, and selecting nodes that meet the attribute requirements as routes to achieve path optimization. The specific steps include setting the initial path score, specifying the starting and end nodes, selecting the path nodes with intersection of resource pool attributes, and selecting the path with the smallest path score as the data route among the paths of these path nodes.
It realizes the special attribute setting of path nodes in the authorized graph according to requirements, select nodes that meet the attribute requirements as the route, and plans the shortest path, which improves the efficiency and flexibility of path optimization.
Smart Images
Figure CN119544583A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer network routing methods, and in particular to a Dijkstra routing optimization method and device implemented based on special attributes of path nodes in video conferencing. Background Art
[0002] Dijkstra's method, also known as the shortest path method, aims to solve the shortest path problem in a weighted graph. The main feature of the Dijkstra method is that it starts from the starting point and adopts a greedy method strategy, traversing the adjacent nodes of the vertex closest to the starting point and not visited each time until it reaches the end point. However, when it is often applied to products or projects, the nodes in the weighted graph are not a simple symbol in the method. For example, in a conference network, each node is a media control unit, and the links between multiple media control units are correctly planned by the Dijkstra method.
[0003] However, in actual applications, if the media control unit MCUs of two companies need to transfer traffic through certain specific MCUs, and other MCUs cannot meet the conditions for some reason, a new shortest path needs to be selected. However, since there are more nodes outside, they all depend on the existing scores, so the existing node cascade scores cannot be changed. Based on the existing scores, it is necessary to improve the existing algorithm for planning the shortest path to meet the needs. Summary of the invention
[0004] The present invention provides a Dijkstra routing optimization method and device based on the special attributes of path nodes, which classifies the resource pool attributes of some path nodes with special attributes in a weighted graph, can adaptively select appropriate paths, select nodes that meet the attribute requirements as routes, and realize path optimization.
[0005] In a first aspect, the present invention provides a route optimization method, characterized in that the method comprises the following steps: Set initial path scores for direct paths between all existing path nodes; Set resource pool attributes for all existing path nodes; Specify two nodes, one as the start node and one as the end node; Selecting a path node between the start node and the end node whose resource pool attributes have an intersection; Among all the paths between the start node and the end node that only pass through the path nodes with intersection of the resource pool attributes, a path with the smallest path score is selected as the data routing path.
[0006] In a second aspect, the present invention provides a route optimization device, characterized in that the device includes a path score setting device, a special attribute setting device, an attribute judgment device and a shortest path calculation device; wherein The path score setting device is used to set an initial path score for the direct paths between all existing routing nodes; The special attribute setting device is used to set resource pool attributes for all existing path nodes; The attribute judgment device is used to select path nodes with intersecting resource pool attributes between the start node and the end node as a path available node set; The shortest path calculation device is used to select a path with the smallest path score from all paths between a start node and an end node that only pass through the path nodes with intersection of resource pool attributes as a data routing path based on the path available node set.
[0007] The beneficial technical effect of the present invention is to set special attributes for certain path nodes in the weighted graph according to needs, then select nodes that meet the attribute requirements as feasible routes, plan the shortest path, and achieve path optimization. BRIEF DESCRIPTION OF THE DRAWINGS
[0008] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0009] Figure 1 It is a schematic diagram of solving the shortest path between nodes based on the Dijkstra method provided in the prior art; Figure 2 It is a schematic diagram of solving the shortest path between nodes using a Dijkstra routing optimization method based on special attributes of path nodes provided by Embodiment 1 of the present invention; Figure 3 It is a flow chart of a Dijkstra routing optimization method implemented based on special attributes of path nodes provided by an embodiment of the present invention; Figure 4 It is a schematic diagram of a Dijkstra routing optimization device based on special attributes of path nodes provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0010] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. SUMMARY OF THE INVENTION As mentioned above, the present invention provides a Dijkstra routing optimization method and device based on the special attributes of path nodes. Special attributes are set for certain path nodes in the weighted graph according to needs, and then nodes that meet the attribute requirements are selected as feasible routes to plan the shortest path and achieve path optimization.
[0012] Exemplary Methods Among the shortest path calculation methods, Dijkstra's method is a method for solving the weighted shortest path problem with non-negative weighted edges. It is one of the most classic methods in graph theory. The shortest path problem refers to finding a path from a given starting vertex to a target vertex in a directed or undirected graph so that the sum of the weights of all edges on the path is minimized. This problem is widely used in computer networks, map navigation, traffic planning and other fields.
[0013] The basic idea of Dijkstra's method is to start from the starting vertex and find the shortest path to all other vertices by gradually expanding the path. During the execution of the method, a distance array is maintained to record the shortest distance from each vertex to the starting vertex, and a priority queue (usually a minimum heap) is used to select the vertex with the current shortest distance. The method steps are as follows: 1) Set the distance of the starting vertex to 0 and the distances of other vertices to infinity; 2) Select the vertex with the smallest current distance as the current vertex; 3) Traverse all adjacent vertices of the current vertex and calculate the temporary distance to these adjacent vertices. If the temporary distance is less than the currently known distance, update the distance array; 4) Mark the current vertex as visited and remove it from the priority queue; 5) Repeat steps 2 and 3 until all vertices are marked as visited.
[0014] Figure 1 This is a schematic diagram of solving the shortest path between nodes based on the Dijkstra method provided by the prior art. Assume that we know the cascade scores between each node as Figure 1 As shown, the process of solving the shortest path from v3 to v5 using the Dijkstra method is as follows: (1) Create two sets: C: the set of currently established routes, S: the set of points that have not yet been added to the topology. Initially: C:{v3---v5:∞}, S:{v1,v2,v4,v6,v7} (2) v1 insert: ① Calculate the shortest path from v1 to an existing node in set C: v1--v3 shortest path = min(score of direct path from v1 to v3, score of direct path from v1 to other nodes in set C (v5) + score of shortest path from other nodes in set C to v3) = min(4,∞+∞) = 4 The shortest path from v1 to v5 = min(the score of the direct path from v1 to v5, the score of the direct path from v1 to other nodes in the C set (v3) + the score of the shortest path from other nodes in the C set to the v5 node) = min(∞, 4+∞) = ∞ ②Use v1 to update the shortest path between each node pair in other sets C: v3--v5 shortest path = min(current v3 to v5 shortest path score, v3 to v1 shortest path score + v1 to v5 shortest path) = min(∞, 4+∞) = ∞ ③Recalculate set C and set S: C:{v1-v3,score:4, intermediate nodes[] v1-v5,score:∞, intermediate nodes[] v3-v5,score:∞,intermediate nodes[]} S:{v2,v4,v6,v7} (3) v4 is inserted, and sets C and S are recalculated according to step 2). ① Calculate the shortest path from v4 to the existing nodes in set C: v4--v1 shortest path = min(score of direct path from v4 to v1, score of direct path from v4 to other nodes in set C (v3, v5) + score of shortest path from other nodes in set C (v3, v5) to v1) = min(min(1, 2+4), min(1, 2+∞)) = 1. v4--v3 shortest path = min(score of direct path from v4 to v3, score of direct path from v4 to other nodes in set C (v1, v5) + score of shortest path from other nodes in set C (v1, v5) to v3) = min(min(2, 1+4), min(2, 2+∞)) = 2. The shortest path from v4 to v5 = min(score of direct path from v4 to v5, score of direct path from v4 to other nodes in set C (v1, v3) + score of shortest path from other nodes in set C (v1, v3) to node v5) = min(min(2, 1+∞), min(2, 2+∞)) = 2.
[0015] ②Use v4 to update the shortest path between each node pair in set C: v1--v3 shortest path = min(the current shortest path score from v1 to v3, the shortest path score from v1 to v4 + the shortest path from v4 to v3) = min(4, 1+2) = 3, the score changes, and the intermediate node v4 is recorded. v1--v5 shortest path = min(the current shortest path score from v1 to v5, the shortest path score from v1 to v4 + the shortest path from v4 to v5) = min(∞, 1+2) = 3, the score changes, and the intermediate node v4 is recorded. 3--v5 shortest path = min(the current shortest path score from v3 to v5, the shortest path score from v3 to v4 + the shortest path from v4 to v5) = min(∞, 2+2) = 4, the score changes, and the intermediate node v4 is recorded.
[0016] ③Recalculate set C and set S: C:{ v1--v3, score=3, intermediate node: [v4] v1--v4,score=1,intermediate nodes:[] v1--v5, score=3, intermediate node: [v4] v3--v4,score=2,intermediate nodes:[] v3--v5, score=4, intermediate node: [v4] v4--v5,score=2,intermediate nodes:[] } S:{v2,v6,v7} (4) The following steps are the same as steps (2) and (3). v2, v6, and v7 are inserted into set C, and set S is updated at the same time. The update process is ignored here.
[0017] Finally, the Dijkstra method to solve the shortest path from v3 to v5 has 6 steps, as follows: 1) Specify two nodes, such as v3 and v5 in the above process.
[0018] 2) Introduce two sets (C, S), the C set contains the points of the shortest path that have been found (and the corresponding shortest length + intermediate nodes), and the S set contains the points of the shortest path that have not been found (as shown in the figure above, v3--v5 are not directly connected, so they are initially ∞).
[0019] 3) Randomly select a node v1 from the S set: Step 1: Calculate the shortest path from this node to all existing nodes in C. The specific method is as follows: (assuming v1--v3 is required), obtain the direct path score 1: v1--v3 = dscore (drawn in the figure). Score 2 obtained by using other existing nodes e2 (not v3) in C as the route: v1--v3 = (v1--e1) direct path score + (e1--v3) shortest path score = score2. Score 3 obtained by using other existing nodes e3 (not v3) in C as the route: v1--v3 = (v1--e2) direct path score + (e2--v3) shortest path score = score3..... Score obtained by using other existing nodes eN (not v3) in C as the route: v1--v3 = (v1--eN) direct path score + (eN--v3) shortest path score = scoreN. The shortest path score from v1 to v3 = min(dscore, score2, score3, scoreN). Similarly, the scores of all other paths from v1 to C can be calculated using the above method.
[0020] Step 2: Use v1 to update the path scores of all existing nodes in C.
[0021] e1--e2 = min(current shortest path score, (e1--v1) shortest path score + (v1--e2) shortest path score). e1--e3 = min(current shortest path score, (e1--v1) shortest path score + (v1--e3) shortest path score)...... 4) Add v1 to set C, subtract v1 from set S, and update sets C and S 5) Loop through steps 3) and 4) until S is empty 6) Obtain the shortest path score between every two nodes in set C, as well as the path nodes passed in between.
[0022] In the above embodiment, we know through the calculation method of the shortest path that the shortest path from v3 to v5 is: v3--v4--v5, and the path score is 4 points. Now map the above routing topology to Xiaoyu's conference topology. Each node in the figure corresponds to a media processing unit. Although we can calculate the shortest path by relying on the Dijkstra method, now assume that v6 and v7 must be used as routes between v3 and v5. For some reason, v1, v2, and v4 cannot meet the conditions, and the existing node cascade scores cannot be changed (because there are more nodes outside, which depend on the existing scores). Based on the existing scores, we can only know that v3-v4-v5 is the shortest path through the Dijkstra method. This problem cannot be solved. Therefore, it is necessary to improve the existing algorithm to achieve the required functions.
[0023] Figure 2 This is a schematic diagram of solving the shortest path between nodes using a Dijkstra routing optimization method based on special attributes of path nodes provided by an embodiment of the present invention. Special attributes are set for certain path nodes in the weighted graph according to whether the path nodes can be used for flow transfer in the path, that is, the path nodes are classified by special attributes such as resource pools or resource domains. When setting special attributes of the resource pool, the special attributes assigned to the node are determined by the "and or" conditional relationship between the two path nodes. If two path nodes with an "and" conditional relationship are assigned two mutually intersecting resource pool attributes, the two path nodes are reachable; if two path nodes with an "or" conditional relationship are assigned two non-intersecting resource pool attributes, the two path nodes are unreachable.
[0024] like Figure 2 As shown, improvements are made on the existing basis, and some special resource domain or resource pool attributes are given to the path nodes. For example, v3 and v5 are media control units of two enterprises. The resource pool attribute of the enterprise where v3 is located can be assigned as 1, and the resource pool attribute of the enterprise where v5 is located can be assigned as 2. Then, the resource pool attribute setting of v6 only needs to ensure that there is an intersection of resource pool attributes between it and v3 and v7, and between v7 and v6 and v5, so that v3 and v5 can be set to be reachable in terms of resource pool attributes. Finally, for other nodes that cannot meet the conditions, different resource pool attributes are assigned to other nodes such as v1, v2, and v4 to ensure that v1, v4 and v3 are unreachable, or v2, v4 and v5 are unreachable (the two path nodes are in an or relationship, not an and relationship), so that the path channel between v3 and v5 must pass through nodes v6 and v7.
[0025] This method is generally used online to add v6 and v7 whitelists to v3 and v5, and control the cascade relationship between the two nodes through the resource pool. From the above figure, you can find that v3--v6--v4--v7--v5 is also feasible, but the score of v3--v6--v7--v5 is smaller, so the path of v3--v6--v7--v5 is selected.
[0026] Further expanding on the above solution, we can give each node more attributes to control the cascade mode between them. At this time, the following steps are performed to determine whether the path is really reachable: if (whether attribute 1 condition is met) else (whether attribute 2 is satisfied) .......... else (is the score not ∞) Only when the above conditions are met can it be truly proved that the path nodes are reachable.
[0027] The special attributes of the path node can be set to various different types of attributes such as resource pool, resource domain, etc. according to the required node connection method, and each attribute of the path node does not interfere with each other and can be used independently for the calculation and planning of the shortest path to produce different cascading methods.
[0028] Figure 3 300 is a flowchart of a Dijkstra routing optimization method based on special attributes of path nodes provided by an embodiment of the present invention. With reference to the above figures, the routing optimization method 300 can be performed by any suitable device, module or apparatus. In some embodiments, operations 301-303 in method 300 are performed in sequence.
[0029] Beginning at operation 301, initial path scores are set for direct paths between all existing routing nodes; Then proceed to operation 302, set special attributes for all path nodes according to the connection requirements, set attributes that have intersections with each other for nodes that meet the conditions, and set attributes that have no intersections with each other for nodes that do not meet the conditions; Then proceed to operation 303, using Dijkstra algorithm, select a path with the smallest sum of path scores from the start node and the end node through all the node paths that meet the attribute conditions as the data routing path. The specific steps of the operation are: specify two routing nodes as the start node and the end node; select all the path nodes that meet the attribute conditions as a path available node set, and all the following operations are performed based on the path nodes in the set.
[0030] Two sets (C, S) are introduced, the C set contains the points of the shortest path that have been calculated, the corresponding shortest path scores and the intermediate nodes, and the S set contains the points for which the shortest path has not been calculated; a node is randomly selected from the S set, and the shortest path from the randomly selected node to all existing routing nodes in C is first calculated, and then the randomly selected node is used to update the path scores of all existing routing nodes in C; the randomly selected node is added to the set C, and the randomly selected node is reduced from the set S, and the sets C and S are updated; the above two steps are executed repeatedly until S is empty; the shortest path score between any two routing nodes in the set C and the intermediate routing nodes are obtained, and the one with the smallest sum of path scores is selected as the data routing path.
[0031] Exemplary device 1 Figure 4 It is a schematic diagram of a Dijkstra routing optimization device based on special attributes of path nodes provided by an embodiment of the present invention.
[0032] The device 400 includes a path score setting device 401, a special attribute setting device 402, an attribute judgment device 403 and a shortest path calculation device 404; wherein The path score setting means 401 is used to set initial path scores for direct paths between all existing routing nodes; The special attribute setting means 402 is used to set resource pool attributes for all existing path nodes; The attribute judgment device 403 is used to select path nodes with intersecting resource pool attributes between the start node and the end node as a path available node set; The shortest path calculation means 404 is used to select a path with the smallest path score from all paths between a start node and an end node that only pass through the path nodes with intersection of resource pool attributes as a data routing path based on the path available node set.
[0033] The special attribute setting device 402 sets the resource pool attribute for the path node according to a specific requirement, and the attributes of two interoperable path nodes are set to the intersection of the resource pool attributes.
[0034] The attribute judgment means 403 screens the path nodes according to the set resource pool attributes, and sets all the path nodes with intersection of resource pool attributes as the path available node set.
[0035] The device calculates and plans the shortest path based on the set of available nodes on the path.
[0036] The shortest path calculation device 404 is used to solve the shortest path based on the Dijkstra algorithm.
[0037] The path score setting means 401 sets an initial path score for direct paths between all existing routing nodes; The special attribute setting means 402 sets resource pool attributes for all existing path nodes; The shortest path calculation means 404 specifies two routing nodes as a start node and an end node; The shortest path calculation means 404 sets a first set (C) and a second set (S) based on the path available node set, wherein the first set includes points of the shortest path that have been obtained, corresponding shortest path scores and intermediate nodes, and the second set includes points of the shortest path that have not been obtained; The shortest path calculation means 404 randomly selects a node from the second set, first calculates the shortest path from the randomly selected node to all existing routing nodes in the first set, and then uses the randomly selected node to update the path scores of all existing routing nodes in the first set; The shortest path calculation device 404 adds the randomly selected node to the first set, reduces the randomly selected node from the second set, and updates the first set and the second set; The shortest path calculation device 404 executes the above two steps in a loop until the second set is empty; The shortest path calculation means 404 obtains the shortest path scores between any two routing nodes and the intermediate routing nodes in the first set.
[0038] The path score setting means 401 sets the initial path score of two nodes without a directly connected path to infinity.
[0039] Although the spirit and principle of the present application have been described with reference to several specific embodiments, it should be understood that the present application is not limited to the disclosed specific embodiments, and the division of various aspects does not mean that the features in these aspects cannot be combined to benefit, and such division is only for the convenience of expression. The present application is intended to cover various modifications and equivalent arrangements included in the spirit and scope of the attached claims.
[0040] The present invention also provides: 1. A route optimization method, characterized in that the method comprises the following steps: Set initial path scores for direct paths between all existing path nodes; Set resource pool attributes for all existing path nodes; Specify two nodes, one as the start node and one as the end node; Selecting a path node between the start node and the end node whose resource pool attributes have an intersection; Among all the paths between the start node and the end node that only pass through the path nodes with intersection of the resource pool attributes, a path with the smallest path score is selected as the data routing path.
[0041] 2. The route optimization method according to claim 1 is characterized in that the method further comprises setting the resource pool attribute for the path node according to specific requirements, and the attributes of two interoperable path nodes are set to the intersection of the resource pool attributes.
[0042] 3. The routing optimization method according to claim 1 is characterized in that the method further comprises screening the path nodes according to the set resource pool attributes, and taking the path nodes having intersections of all resource pool attributes as the path available node set.
[0043] 4. The routing optimization method according to claim 1 is characterized in that the method also includes calculating and planning the shortest path based on the set of available nodes on the path.
[0044] 5. The routing optimization method according to claim 1 is characterized in that the method also includes solving the shortest path based on the Dijkstra algorithm.
[0045] 6. The route optimization method according to claim 5, characterized in that the method further comprises the following steps: Setting initial path scores for direct paths between all existing routing nodes; Set resource pool attributes for all existing path nodes; Specify two routing nodes as the start node and the end node; A first set (C) and a second set (S) are set based on the path available node set, wherein the first set includes points of the shortest path that have been found, corresponding shortest path scores and intermediate nodes, and the second set includes points of the shortest path that have not been found; Randomly select a node from the second set, first calculate the shortest path from the randomly selected node to all existing routing nodes in the first set, and then use the randomly selected node to update the path scores of all existing routing nodes in the first set; Add the randomly selected node to the first set, reduce the randomly selected node from the second set, and update the first set and the second set; The above two steps are executed repeatedly until the second set is empty; The first set obtains the shortest path scores between any two routing nodes and the routing nodes passed in between.
[0046] 7. The route optimization method according to any one of items 1 to 6, further comprising: The initial path fraction for two nodes with no direct connecting path is set to infinity.
[0047] 8. A route optimization device, characterized in that the device comprises a path score setting device, a special attribute setting device, an attribute judgment device and a shortest path calculation device; wherein The path score setting device is used to set an initial path score for the direct paths between all existing routing nodes; The special attribute setting device is used to set resource pool attributes for all existing path nodes; The attribute judgment device is used to select path nodes with intersecting resource pool attributes between the start node and the end node as a path available node set; The shortest path calculation device is used to select a path with the smallest path score from all paths between a start node and an end node that only pass through the path nodes with intersection of resource pool attributes as a data routing path based on the path available node set.
[0048] 9. The route optimization device according to claim 8 is characterized in that the special attribute setting device sets the resource pool attribute for the path node according to specific requirements, and the attributes of two interoperable path nodes are set to the intersection of the resource pool attributes.
[0049] 10. The route optimization device according to Article 8 is characterized in that the attribute judgment device screens the path nodes according to the set resource pool attributes, and sets all path nodes with intersection of resource pool attributes as the path available node set.
[0050] 11. The route optimization device according to Article 8 is characterized in that the device calculates and plans the shortest path based on the set of available nodes on the path.
[0051] 12. The route optimization device according to Article 8 is characterized in that the shortest path calculation device is used to solve the shortest path based on the Dijkstra algorithm.
[0052] 13. The route optimization device according to claim 12, characterized in that: The path score setting means sets an initial path score for direct paths between all existing routing nodes; The special attribute setting device sets resource pool attributes for all existing path nodes; The shortest path calculation device specifies two routing nodes as a starting node and an ending node; The shortest path calculation device sets a first set (C) and a second set (S) based on the path available node set, the first set includes points of the shortest path that have been found, corresponding shortest path scores and intermediate nodes, and the second set includes points of the shortest path that have not been found; The shortest path calculation device randomly selects a node from the second set, first calculates the shortest path from the randomly selected node to all existing routing nodes in the first set, and then uses the randomly selected node to update the path scores of all existing routing nodes in the first set; The shortest path calculation device adds the randomly selected node to the first set, reduces the randomly selected node from the second set, and updates the first set and the second set; The shortest path calculation device executes the above two steps in a loop until the second set is empty; The shortest path calculation device obtains the shortest path score between any two routing nodes and the intermediate routing nodes in the first set.
[0053] 14. The route optimization device according to any one of items 8 to 12, characterized in that: The path score setting device sets the initial path score of two nodes without a directly connected path to infinity.
Claims
1. A routing optimization method, characterized in that: The method comprises the following steps; wherein, Set initial path scores for direct paths between all existing path nodes; Set resource pool attributes for all existing path nodes; Specify two nodes, one as the start node and one as the end node; Selecting a path node between the start node and the end node whose resource pool attributes have an intersection; Among all the paths between the start node and the end node that only pass through the path nodes with intersection of the resource pool attributes, a path with the smallest path score is selected as the data routing path.
2. The routing optimization method according to claim 1, characterized in that: The method further includes setting the resource pool attribute for the path node according to specific requirements, and setting the attributes of two interoperable path nodes to the intersection of the resource pool attributes.
3. The routing optimization method according to claim 1, characterized in that: The method further includes screening the path nodes according to the set resource pool attributes, and taking the path nodes having intersections of all resource pool attributes as the path available node set.
4. The routing optimization method according to claim 1, characterized in that: The method further includes calculating and planning the shortest path based on the set of available nodes on the path.
5. The route optimization method according to claim 1, characterized in that: The method further includes solving the shortest path based on the Dijkstra algorithm.
6. The route optimization method according to claim 5, characterized in that: The method also includes the following steps: Setting initial path scores for direct paths between all existing routing nodes; Set resource pool attributes for all existing path nodes; Specify two routing nodes as the start node and the end node; A first set (C) and a second set (S) are set based on the path available node set, wherein the first set includes points of the shortest path that have been found, corresponding shortest path scores and intermediate nodes, and the second set includes points of the shortest path that have not been found; Randomly select a node from the second set, first calculate the shortest path from the randomly selected node to all existing routing nodes in the first set, and then use the randomly selected node to update the path scores of all existing routing nodes in the first set; Add the randomly selected node to the first set, reduce the randomly selected node from the second set, and update the first set and the second set; The above two steps are executed repeatedly until the second set is empty; The first set obtains the shortest path scores between any two routing nodes and the routing nodes passed in between.
7. The route optimization method according to any one of claims 1 to 6, characterized in that: The method further comprises: The initial path fraction for two nodes with no direct connecting path is set to infinity.
8. A route optimization device, characterized in that: The device includes a path score setting device, a special attribute setting device, an attribute judgment device and a shortest path calculation device; wherein The path score setting device is used to set an initial path score for the direct paths between all existing routing nodes; The special attribute setting device is used to set resource pool attributes for all existing path nodes; The attribute judgment device is used to select path nodes with intersecting resource pool attributes between the start node and the end node as a path available node set; The shortest path calculation device is used to select a path with the smallest path score from all paths between a start node and an end node that only pass through the path nodes with intersection of resource pool attributes as a data routing path based on the path available node set.
9. The route optimization device according to claim 8, characterized in that: The special attribute setting device sets the resource pool attribute for the path node according to specific requirements, and the attributes of two interoperable path nodes are set to the intersection of the resource pool attributes.
10. The route optimization device according to claim 8, characterized in that: The attribute judgment device screens the path nodes according to the set resource pool attributes, and sets all the path nodes with intersection of resource pool attributes as the path available node set.