A shortest path routing computation method and apparatus
By confirming the number and attributes of node channels in the telecom network management system, and combining and bundling channels, the problem of long calculation time for the shortest path route is solved, improving calculation efficiency and user experience.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- FIBERHOME TELECOMMUNICATION TECHNOLOGIES CO LTD
- Filing Date
- 2023-07-03
- Publication Date
- 2026-07-21
AI Technical Summary
In existing telecommunications network management systems, calculating the K shortest path routes is time-consuming, especially in complex network configurations, which negatively impacts user experience.
The shortest path routing calculation method is adopted. By confirming the number of channels between nodes, channels are combined and bundled. Priority is given to the weight, rate and stability attributes of channels. The time consumption is monitored and the bundling operation is adjusted to reduce unnecessary repeated path finding.
It reduces the time spent calculating the shortest path route, improves the user experience, and increases computational efficiency by bundling path management and reusing unused paths.
Smart Images
Figure CN116846812B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of routing technology, and in particular to a method and apparatus for calculating the shortest path. Background Technology
[0002] In current telecommunications network management systems, calculating the K shortest routes currently uses a loop. While this works for simple networks, complex networks become time-consuming, significantly impacting user experience.
[0003] Therefore, overcoming the shortcomings of the existing technology is an urgent problem to be solved in this technical field. Summary of the Invention
[0004] The technical problem to be solved by this invention is the long time required for shortest path routing calculation.
[0005] The present invention adopts the following technical solution:
[0006] In a first aspect, the present invention provides a method for calculating the shortest path, comprising:
[0007] Confirm the number of channels between nodes in the routing network;
[0008] Channels are combined according to the minimum number of channels between nodes that can be established in the shortest path;
[0009] After multiple rounds of shortest path calculation, the channels between nodes in the current routing network are bundled to provide routing path selection for subsequent packets in the bundled form.
[0010] In this process, the nodes are already bundled into a channel during the first round of shortest path calculation. The bundled channel will not participate in the second round of shortest path search calculation.
[0011] Preferably, the channels are combined according to the minimum number of channels between nodes that can be established in the shortest path, specifically including:
[0012] The shortest path to be established includes multiple nodes, wherein there is a number of channels available for both parties between any two adjacent nodes, and the number of channels may be the same or different between different adjacent nodes;
[0013] The number of shortest paths included in the channel combination is set based on the minimum number of channels available for both parties between all two adjacent nodes.
[0014] Preferably, the method further includes:
[0015] After completing a round of shortest path calculation and corresponding channel combination, the channels owned by each node on the corresponding shortest path will be partially or fully used in combination; among them, for nodes whose channels are partially used, they will participate in the next round of shortest path calculation with their remaining unused channels.
[0016] Preferably, the channels between nodes also include one or more of the following: weight attribute, rate attribute, and stability attribute.
[0017] Preferably, the combination according to the minimum number of channels between nodes included in the shortest path can be established specifically includes:
[0018] Based on the principle that the channels between nodes have the same priority, this is one of the additional conditions for binding. In accordance with the minimum number of channels criterion, the binding of channels between the corresponding nodes is completed, and the channel combination process is finally realized by relying on the bound channels.
[0019] Preferably, the method further includes:
[0020] Monitor the time taken when the current routing network performs the shortest path search. When the corresponding time exceeds the first preset threshold, only channels that match in terms of weight attribute, rate attribute and stability attribute will be subjected to the first binding operation.
[0021] Monitor the time taken by the current routing network to find the shortest path after completing the first binding operation. If the corresponding time exceeds the second preset threshold, perform the second binding operation only on the channels matched based on the weight attribute and the rate attribute.
[0022] Monitor the time taken by the current routing network to find the shortest path after completing the second binding operation. If the corresponding time exceeds the third preset threshold, perform the third binding operation only on the channel matched based on the weight attribute alone.
[0023] Preferably, the first preset threshold, the second preset threshold, and the third preset threshold are in a relationship of increasing sequentially in the order of the first preset threshold, the second preset threshold, and the third preset threshold.
[0024] Preferably, when adding a new node to the routing network and forming a new channel with a previously bound routing node, the method further includes:
[0025] Confirm whether using the newly formed channel to perform shortest path routing calculations with the original routing network will generate a new shortest path.
[0026] If no new shortest route is generated, the existing combination results will not be updated. The newly generated channel will be combined with the channel after binding as an independent channel to participate in the subsequent shortest path finding process.
[0027] If a new shortest route is generated, the channel combination process is re-executed using the channels contained in the original routing network after incorporating the newly generated channels.
[0028] Preferably, the paths calculated during the routing process are bundled together, and the usage status of each channel within them is stored during use. If the usage status is not saturated, subsequent new services will skip the corresponding routing process calculation and directly use the remaining free channels in the corresponding bundled paths.
[0029] Secondly, the present invention also provides a shortest path routing calculation apparatus for implementing the shortest path routing calculation method described in the first aspect, the apparatus comprising:
[0030] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor for performing the shortest path routing calculation method described in the first aspect.
[0031] Thirdly, the present invention also provides a non-volatile computer storage medium storing computer-executable instructions that are executed by one or more processors to perform the shortest path routing calculation method described in the first aspect.
[0032] This invention bundles all reachable paths between two sites to achieve the effect of a logically identical path. During the process of combining channels, the number of paths is managed according to weight mapping. Unused paths in the bundled paths are reused, reducing unnecessary rerouting. This reduces the time spent calculating the shortest path and improves the user experience. Attached Figure Description
[0033] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments of the present invention will be briefly described below. Obviously, the drawings described below are merely some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without any creative effort.
[0034] Figure 1 This is a schematic diagram of a shortest path routing calculation method provided in an embodiment of the present invention;
[0035] Figure 2 This is a schematic diagram of a shortest path routing calculation method provided in an embodiment of the present invention;
[0036] Figure 3 This is a schematic diagram of a shortest path routing calculation method provided in an embodiment of the present invention;
[0037] Figure 4 This is a schematic diagram of a routing network structure provided in an embodiment of the present invention;
[0038] Figure 5 This is a schematic diagram of a bundled routing network structure provided in an embodiment of the present invention;
[0039] Figure 6 This is a schematic diagram of a routing network scenario structure provided by an embodiment of the present invention;
[0040] Figure 7 This is a schematic diagram of another routing network scenario structure provided by an embodiment of the present invention;
[0041] Figure 8 This is a schematic diagram of another routing network scenario structure provided by an embodiment of the present invention;
[0042] Figure 9 This is a schematic diagram of a shortest path routing calculation device provided in an embodiment of the present invention. Detailed Implementation
[0043] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.
[0044] In the description of this invention, the terms "inner", "outer", "longitudinal", "lateral", "upper", "lower", "top", "bottom", etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are only for the convenience of describing this invention and do not require that this invention must be constructed and operated in a specific orientation. Therefore, they should not be construed as limiting this invention.
[0045] In this invention, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first," "second," etc., may explicitly or implicitly include one or more of that feature. In the description of this application, unless otherwise stated, "a plurality of" means two or more.
[0046] In this application, unless otherwise expressly specified and limited, the term "connection" should be interpreted broadly. For example, "connection" can be a fixed connection, a detachable connection, or an integral part; it can be a direct connection or an indirect connection through an intermediate medium. Furthermore, the term "coupled" can refer to an electrical connection that enables signal transmission.
[0047] The shortest path routing calculation method involved in this invention is implemented using an edge-based pathfinding algorithm. If a node can find the next node, it continues the pathfinding process; if it cannot find the next node, it backtracks to the previous node and continues searching for other edges. This algorithm is similar to Dijikstra's edge-based pathfinding algorithm. The edges are bundled and packaged logical routing edges, and the mapping relationship between the number of edges and their weights is recorded.
[0048] If a node has an unused route in a path calculated during the pathfinding process, it can continue to be used so that other nodes can reuse it when they reach that node again, thus reducing unnecessary repeated pathfinding.
[0049] The current node in the pathfinding process records the number of edges from the previous node to the current node. This information is used to calculate whether there are any remaining available edges from the previous node, which can be reused for pathfinding. If there are no available paths, node backtracking can be implemented quickly to speed up pathfinding efficiency.
[0050] For path results with different weights, the system will search for other shortest paths again for comparison until the final output path is the K shortest paths in the entire routing graph.
[0051] If the final number of paths does not reach the required K, simply return the minimum number of paths that can be found.
[0052] Furthermore, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.
[0053] Example 1:
[0054] Embodiment 1 of the present invention provides a method for calculating the shortest path, such as... Figure 1 As shown, it includes:
[0055] In step 201, the number of channels between each node in the routing network is confirmed.
[0056] In step 202, channels are combined according to the minimum number of channels between nodes included in the shortest path that can be established.
[0057] The channels between nodes also include one or more of the following attributes: weight, rate, and stability. In the simplest scheme, these three attributes can be disregarded, and the combination can be based solely on the number of channels. In alternative schemes, these three attributes can be selected individually. For example, channels between nodes can be grouped based on their priority, and the minimum number of channels criterion is followed to bind the channels between nodes. The combination process is then achieved by relying on the bound channels. This will be described in more detail in subsequent embodiments of the invention.
[0058] In step 203, after multiple rounds of shortest path calculation, the channels contained between each node in the current routing network are bundled to provide routing path selection in the form of channel bundling for subsequent packets.
[0059] Among them, channels that have been bundled together with nodes in the first round of shortest path calculation will not participate in the second round of shortest path calculation.
[0060] This invention bundles all reachable paths between two sites to achieve the effect of a logically identical path. During the process of combining channels, the number of paths is managed according to weight mapping. Unused paths in the bundled paths are reused, reducing unnecessary rerouting. This reduces the time spent calculating the shortest path and improves the user experience.
[0061] In this embodiment of the invention, the combination of nodes according to the minimum number of channels between nodes included in the shortest path that can be established in step 202 is further described with a specific implementation mechanism, which includes:
[0062] The shortest path to be established includes multiple nodes, wherein there is a number of channels available for both parties between any two adjacent nodes, and the number of channels may be the same or different between different adjacent nodes;
[0063] The number of shortest paths included in the channel combination is set based on the minimum number of channels available for both parties between all two adjacent nodes.
[0064] After completing a round of shortest path calculation and corresponding channel combination, the channels owned by each node on the corresponding shortest path will be partially or fully used; among them, for nodes whose channels are partially used, they will participate in the next round of shortest path calculation with their remaining unused channels.
[0065] In the implementation process, the more weight, rate, and stability attributes mentioned above are considered in the shortest path calculation, the more channel bundles are generated, resulting in fewer channels in each bundle. The reason is straightforward: with more factors considered, the difficulty of ensuring channels can be bundled together increases. Under this premise, and in conjunction with the embodiments of this invention, there is also a preferred extension scheme that allows for tiered division and association processing based on the degree of attention given to the three attributes during use, such as... Figure 2 As shown, the method also includes:
[0066] In step 301, the time taken by the current routing network to find the shortest path is monitored. When the corresponding time exceeds the first preset threshold, the first binding operation is performed only if the channel matches in terms of weight attribute, rate attribute and stability attribute.
[0067] In step 302, the time taken by the current routing network to find the shortest path after completing the first bundling operation is monitored. If the corresponding time exceeds the second preset threshold, the second bundling operation is performed only on the channels matched based on the weight attribute and the rate attribute.
[0068] In step 303, the time taken by the current routing network to find the shortest path after completing the second bundling operation is monitored. If the corresponding time exceeds the third preset threshold, the third bundling operation is performed only on the channel matched based on the weight attribute alone.
[0069] The first, second, and third preset thresholds are arranged in ascending order, increasing sequentially. This arrangement is based on the consideration that after attributes are superimposed, releasing an attribute dimension step-by-step through steps 301-303 progressively reduces the effectiveness of mitigating computational time. In other words, the improvement in time efficiency achieved by releasing an attribute dimension at each step (due to various factors, including an increase in the number of routing nodes) is less significant than before. Therefore, increasing the preset thresholds reduces the time interval between steps 301-303, thus minimizing the impact of the proposed solution on the overall routing computation process from the perspective of total computational resource consumption.
[0070] In conjunction with embodiments of the present invention, as one possible implementation scheme, when adding a new node to the routing network and forming a new channel with a previously bound routing node, such as... Figure 3 As shown, the method also includes:
[0071] In step 401, it is confirmed whether using the newly formed channel to perform shortest path routing calculation with the original routing network will generate a new shortest routing path.
[0072] In step 402, if no new shortest route is generated, the existing binding results are not updated. The newly generated channel is combined with the bound channel as an independent channel to participate in the subsequent shortest path finding process.
[0073] In step 403, if a new shortest route path is generated, the channel combination process is re-executed after incorporating the newly generated channels into the channels contained in the original routing network.
[0074] The bundled paths calculated during the routing process will store the usage status of each channel within them during use. If the usage status is not saturated, subsequent new services will skip the corresponding routing calculation and directly use the remaining free channels in the bundled paths.
[0075] The following two diagrams illustrate the original routing network structure and the routing network structure after the binding process according to the method of this embodiment of the invention.
[0076] like Figure 4 This is a diagram illustrating a real-world fiber optic interconnection scenario between network elements. If targeting... Figure 4 To create six routes between NE_S and NE_D that do not share a port, based on a real fiber optic connection scenario, six route calculations from NE_S to NE_D must be performed to obtain six route results.
[0077] according to Figure 4 We know that there are 12 fiber connections from NE_S to NE_M, and 12 fiber connections from NE_M to NE_D. If we bundle all the fiber connections between the two network elements, then logically the two network elements will form a single path, such as... Figure 5 As shown. At this point, we are tracing the logical path, which is for... Figure 5 The logical path is used to perform route calculation from NE_S to NE_D. At this time, we only need to perform route calculation once, and then we can arbitrarily combine the calculation results with any fiber optic connection between any two network elements to obtain 6 routes.
[0078] pass Figure 5 By using a bundling method, we reduced the route calculation from 6 times to 1 time, greatly improving the efficiency of route calculation for multiple paths.
[0079] Figure 4 and Figure 5This paper only introduces the core idea of this patent by providing a simple example of bundling. Due to issues such as path weights and varying path counts in each bundle during actual pathfinding, bundling cannot be used simply. Therefore, the following sections will describe the routing calculation methods for multiple paths in two scenarios: equal and unequal weights.
[0080] Example 2:
[0081] This invention embodiment is based on the methodological idea of embodiment 1, and demonstrates how to complete the relevant binding process in embodiment 1 of this invention, considering only the number of channels between nodes.
[0082] like Figure 6 As shown, the numbers represent the number of connections with the same weight between two nodes. For example, there are 3 connections with the same weight between node S and node B, and 6 connections with the same weight between node A and node E. It is assumed that all two nodes have the same weight.
[0083] according to Figure 6 In this scenario, the steps to calculate the 6 shortest paths between node S and node D are as follows:
[0084] The first step involves calculating six paths from node S to node B: {SB, 3}, {SC, 2}, and {SD, 1}. Based on the number of paths, it is known that at least three pathfinding operations must be performed from node S.
[0085] The second step is to select the first pathfinding for the shortest route from node S to node B, and find that there are 3 paths from node B to node A, which are {BA, 3}.
[0086] The third step is to continue the pathfinding from point A until the destination D is reached. At this point, record {AE, 6}, {EG, 6}, and {GD, 6}.
[0087] The fourth step is to calculate the three shortest paths from the starting point S to the ending point D (SBAEGD), and there are three available paths for each of AE, EG and GD.
[0088] In the fifth step, since only three shortest paths have been obtained, the pathfinding process will continue to obtain the other three shortest paths. At this point, since the path from node S to node B has been exhausted, the pathfinding process will continue from node S to node C. The calculation shows that there are two paths from node C to node A: {CA, 2}. Since there are still three remaining paths available for AE, EG, and GD in the third step, there is no need to perform route calculations for nodes A and D. The two paths AE, EG, and GD are reused to form two new shortest paths (SCAEGD), and each of AE, EG, and GD still has one available path.
[0089] Step 6: Since only 5 shortest paths have been obtained at this point, we will continue the pathfinding process to obtain 1 more shortest path. At this point, since the path from node S to node C is exhausted, we will continue the pathfinding process in the direction between node S and node D. Similar to step 5, after reaching node A, we will reuse the remaining path from AE, EG, and GD to form a new shortest path (SDAEGD). A total of 6 shortest paths have been successfully obtained, and the pathfinding process ends.
[0090] Step 7: In the end, 6 shortest paths are obtained, namely 3 shortest paths (SBAEGD), 2 shortest paths (SCAEGD), and 1 shortest path (SDAEGD).
[0091] Example 3:
[0092] This invention embodiment is based on the methodological idea of embodiment 1, and demonstrates how to complete the relevant binding process in embodiment 1 of this invention, considering only the number of channels between nodes.
[0093] like Figure 7 As shown, the numbers represent the number of connections with the same weight between two nodes. For example, there are 6 connections with the same weight between node S and node A, and 5 connections with the same weight between node A and node B. It is assumed that all two nodes have the same weight.
[0094] according to Figure 7 In this scenario, the steps to calculate the 6 shortest paths between node S and node D are as follows:
[0095] The first step is to start from node S. There are 6 paths between node S and node A to meet the requirement of 6 paths. First, find the path from node S to node A.
[0096] The second step is to find that there are 5 paths from node A to node B and 6 paths from the previous node of A. Continue to find other paths out of node A to find available paths that have no other exit from node A.
[0097] The third step is to find the path from node B to node D. Since node D has been found, any combination of SA, AB, and BD forms four shortest paths (SABD).
[0098] In the fourth step, since the third step has already obtained 4 shortest paths, and the previous node of node B has 5 paths, we then search for other paths out of node B, and obtain 1 other path from node B to node E (BE, 1).
[0099] Fifth step: Start pathfinding from node E, obtain 3 paths from node E to node D, take out one path ED and form a path (SABED) with SA, AB and BE.
[0100] Step 6: Since only 5 paths have been obtained at this point, we will continue the pathfinding process to find the last shortest path. Since there is only one path preceding node E and it has already been used, we will backtrack to node B. Since there are 5 paths preceding node B and they have also been used, we will backtrack to the previous node A. Node A has 6 paths preceding it, 5 of which have been used, but node A has no other exit paths. We will then backtrack to node S.
[0101] Step 7: Since the backtracked node S is the starting point, the pathfinding starts again from node S. If there is no path available at node S, only 5 path results need to be returned. At this time, a new path is found from node S to node C, and then the pathfinding continues from node C to node E. It is found that node E has two available paths (ED). One path is reused to form a new path (SCFED).
[0102] In the eighth step, a total of 6 paths were obtained: 4 paths (SABD), 1 path (SABED), and 1 path (SCFED).
[0103] Example 4:
[0104] Based on the methodological approach of Embodiment 1, this embodiment of the invention demonstrates how to complete the relevant binding process in Embodiment 1, taking into account the number of channels between nodes and the weight attributes.
[0105] like Figure 8As shown, in {6:(5,4),(10,2)}, "6" represents 6 paths bundled together to form a logical route; (5,4) represents 4 paths with a weight of 5, where "5" represents the weight and "4" represents the number of paths; (10,2) represents 2 paths with a weight of 10, where "10" represents the weight and "2" represents the path. {2:(5,2)} represents 2 paths bundled together to form a logical route, where the first "2" represents the total number of paths; (5,2) represents 2 paths with a weight of 5, where "5" represents the weight and "2" represents the number of paths.
[0106] according to Figure 8 In this scenario, the steps to calculate the 6 shortest paths between node S and node D are as follows:
[0107] Step 1: Start the pathfinding from the starting point S. We find that there are 6 paths between node S and node A, which meet the routing conditions. We will not calculate the routes in other directions for the time being.
[0108] Step 2: Starting from node A, find the path to the destination node D in sequence. Finally, find that there are 6 paths between node A and node B, and 6 paths from node B to the destination node D.
[0109] Step 3: Since we are looking for the shortest path, we freely combine the four paths with a weight of 5 in SA and the four paths with a weight of 5 in segments AB and BD to form three paths with a final weight of 15 (SABD); then we combine the paths with a weight of 10 to form two paths with a weight of 30 (SABD).
[0110] Step 4: Since the four paths with a weight of 15 are definitely the shortest paths, but the other two paths with a weight of 30 are not necessarily the shortest paths, we need to continue the pathfinding to determine whether the path with a weight of 30 is the shortest path.
[0111] Step 5: Since the previous path between nodes B and A has been used up, the pathfinding starting point reverts to the initial node S. From node S, other paths are searched again, and the final path combination found is SC, CF, and FD. Using the minimum weight path combination of SC, CF, and FD path segments, two paths with a weight of 20 (SCFD) are formed.
[0112] Step 6: Since the weights of the two paths in Step 5 are smaller than the weights of the two paths with a weight of 30 in Step 4, the two paths in Step 5 and the other four paths with a weight of 15 in Step 5 are finally selected as the six shortest paths.
[0113] Step 7: Finally, 6 paths are obtained, namely 4 paths with a weight of 15 (SABD) and 2 paths with a weight of 20 (SCFD).
[0114] Example 5:
[0115] like Figure 9 The diagram shown is an architectural schematic of a shortest path routing calculation device according to an embodiment of the present invention. The shortest path routing calculation device of this embodiment includes one or more processors 21 and a memory 22. Figure 9 Take a processor 21 as an example.
[0116] Processor 21 and memory 22 can be connected via a bus or other means. Figure 9 Taking the example of a connection between China and Israel via a bus.
[0117] The memory 22, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs and non-volatile computer-executable programs, such as the shortest path routing calculation method in Embodiment 1. The processor 21 executes the shortest path routing calculation method by running the non-volatile software program and instructions stored in the memory 22.
[0118] Memory 22 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 22 may optionally include memory remotely located relative to processor 21, which can be connected to processor 21 via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
[0119] The program instructions / modules are stored in the memory 22. When executed by one or more processors 21, they perform the shortest path routing calculation method described in Embodiment 1 above, for example, the method described above. Figures 1-3 The steps shown.
[0120] It is worth noting that the information interaction and execution process between the modules and units in the above-mentioned device and system are based on the same concept as the processing method embodiment of the present invention. For details, please refer to the description in the method embodiment of the present invention, and will not be repeated here.
[0121] Those skilled in the art will understand that all or part of the steps in the various methods of the embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc.
[0122] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.
Claims
1. A method for calculating the shortest path, characterized in that, include: Confirm the number of channels between nodes in the routing network; Channels are combined according to the minimum number of channels between nodes that can be established in the shortest path; After multiple rounds of shortest path calculation, the channels between nodes in the current routing network are bundled to provide routing path selection for subsequent packets in the bundled form. In this process, the nodes have already been bundled into a channel during the first round of shortest path calculation. The bundled channels will no longer participate in the second round of shortest path search calculation. The channels between nodes also include weight attributes, rate attributes, and stability attributes; The method further includes: monitoring the time taken by the current routing network to perform shortest path finding; when the corresponding time exceeds a first preset threshold, performing a first bundling operation only on channels that match in terms of weight attribute, rate attribute, and stability attribute; monitoring the time taken by the current routing network to perform shortest path finding after completing the first bundling operation; when the corresponding time exceeds a second preset threshold, performing a second bundling operation only on channels that match in terms of weight attribute and rate attribute; monitoring the time taken by the current routing network to perform shortest path finding after completing the second bundling operation; when the corresponding time exceeds a third preset threshold, performing a third bundling operation only on channels that match in terms of weight attribute.
2. The shortest path routing calculation method according to claim 1, characterized in that, Channel combinations are performed based on the minimum number of channels between nodes in the shortest path that can be established, specifically including: The shortest path to be established includes multiple nodes, wherein there is a number of channels available for both parties between any two adjacent nodes, and the number of channels may be the same or different between different adjacent nodes; The number of shortest paths included in the channel combination is set based on the minimum number of channels available for both parties between all two adjacent nodes.
3. The shortest path routing calculation method according to claim 2, characterized in that, The method also includes: After completing a round of shortest path calculation and corresponding channel combination, the channels owned by each node on the corresponding shortest path will be partially or fully used; among them, for nodes whose channels are partially used, they will participate in the next round of shortest path calculation with their remaining unused channels.
4. The shortest path routing calculation method according to claim 1, characterized in that, The combination based on the minimum number of channels between nodes in the shortest path that can be established specifically includes: Based on the principle that the channels between nodes have the same priority, this is one of the additional conditions for binding. Following the minimum number of channels criterion, the binding of channels between the corresponding nodes is completed, and the channel combination process is finally realized by relying on the bound channels.
5. The shortest path routing calculation method according to claim 1, characterized in that, The first preset threshold, the second preset threshold, and the third preset threshold are in the order of increasing sequentially.
6. The shortest path routing calculation method according to claim 1, characterized in that, When adding a new node to a routing network and establishing a new channel with a previously bound routing node, the method also includes: Confirm whether using the newly formed channel to perform shortest path routing calculations with the original routing network will generate a new shortest path. If no new shortest route is generated, the existing combination results will not be updated. The newly generated channel will be combined with the channel after binding as an independent channel to participate in the subsequent shortest path finding process. If a new shortest route is generated, the channel combination process is re-executed using the channels contained in the original routing network after incorporating the newly generated channels.
7. The shortest path routing calculation method according to any one of claims 1-6, characterized in that, The paths calculated during the routing process are bundled together. During use, the usage status of each channel within the bundle is stored. If the usage status is not saturated, subsequent new services will skip the corresponding routing calculation process and directly use the remaining free channels in the bundled paths.
8. A shortest path routing calculation device, characterized in that, The device includes: At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor for performing the shortest path routing calculation method according to any one of claims 1-7.