Routing method and device, control equipment and storage medium

By optimizing the path selection process in a software-defined network, iterating the adjacent nodes only when specific conditions are met and the cost limit is updated, the problem of slow computing path speed in the existing technology is solved, and efficient and real-time QoS routing is achieved.

CN120528853APending Publication Date: 2025-08-22RUIJIE NETWORKS CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410184231.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-02-19
Publication Date
2025-08-22

AI Technical Summary

Technical Problem

The prior art is difficult to meet the real-time requirements when calculating paths, especially in software-defined networks. The iterative optimization algorithm has a slow calculation speed and it is difficult to efficiently determine the path that meets the quality of service (QoS) requirements.

Method used

By determining the sum of the first target index information and the second target index information of the adjacent node, the path is iterated only when the constraints of the second indicator and the cost limit of the first indicator are met, and the cost limit value is updated, the path selection process is optimized, and the calculation process is reduced.

Benefits of technology

It improves the efficiency of path iteration, can determine the path that meets the service quality requirements faster, reduces the amount of computing, and improves the real-time and efficiency of the routing method.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120528853A_ABST
    Figure CN120528853A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a routing method and device, control equipment and a storage medium, and the method comprises the steps: determining the sum of first target index information and second target index information of a target index for any target index; the target indexes comprise a first index of which the index constraint is a shortest path and a second index of which the index constraint is a constraint value; the first target index information is the index information of the target index between the adjacent node and the destination node, and the second target index information is the index information of the target index after the first path of the current iteration is added to the adjacent node; if the sum of the index information of the second index meets the index constraint of the second index and the sum of the index information of the first index meets the cost limit value of the first index, iterating the first path based on the adjacent nodes and updating the cost limit value based on the adjacent nodes; and determining a target path based on the first path after iteration is completed. According to the embodiment, the calculation process is reduced, and the iteration efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a routing method, apparatus, control device, and storage medium. Background Art

[0002] Routing is a fundamental network layer function in communications networks, determining the path from a source node to a destination node through a series of intermediate switching nodes. Providing Quality of Service (QoS) is a key requirement in many communications network settings and applications. QoS routing involves selecting feasible paths within the network that meet the various QoS requirements of applications.

[0003] The emergence of Software Defined Network (SDN) technology has transformed the traditional network control model, introducing a centralized network controller that manages and configures the entire network. This centralized control model makes switching state distribution more flexible and programmable, better supporting dynamic network adjustment and optimization. Summary of the Invention

[0004] The embodiments of the present application provide a routing method, apparatus, control device, and storage medium for efficiently determining a path and meeting the real-time requirements of routing.

[0005] In a first aspect, an embodiment of the present application provides a routing method, the method comprising:

[0006] For any target indicator, determine the sum of first target indicator information and second target indicator information of the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is the shortest path, and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the adjacent node is added to the first path of the current iteration;

[0007] If the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator, iterating the first path based on the adjacent nodes, and updating the cost limit based on the adjacent nodes;

[0008] Based on the first path after the iteration, a target path is determined; wherein the last hop node of the first path after the iteration is the destination node.

[0009] In the above scheme, during the iterative routing process, for the adjacent nodes that are not in the first path of the current iteration, it is first determined whether the constraints of the second indicator and the cost limit of the first indicator are met after adding the adjacent node. The adjacent node will be added only if both conditions are met. If not, the adjacent node will be skipped, so that the first path after the iteration is completed can meet the requirements of the second indicator, and the indicator information (accumulated value) of the first indicator can be reduced as much as possible, reducing the calculation process and improving the iteration efficiency.

[0010] In some optional implementations, iterating the first path based on the adjacent nodes includes:

[0011] The adjacent node is added to the first path of the current iteration to obtain an updated first path.

[0012] In the above scheme, if the constraint of the second indicator and the cost limit of the first indicator are satisfied after adding the adjacent node, the adjacent node is added to the first path of the current iteration and iterates to the next hop node, thereby completing the next hop update of the first path.

[0013] In some optional implementations, after obtaining the updated first path, the method further includes:

[0014] For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

[0015] In some optional implementations, updating the cost limit based on the adjacent node includes:

[0016] The minimum value of the target cumulative information of the first indicator in all first paths of the current iteration is determined as the new cost limit; wherein, the target cumulative information is the sum of the indicator information of the first indicator corresponding to the time when the second indicator is shortest between the adjacent node and the destination node, and the indicator information of the first indicator after the adjacent node is added to the first path of the current iteration.

[0017] The above solution further reduces the cost limit by determining the minimum value of the sum of the indicator information of the first indicator as the new cost limit, thereby increasing the screening of subsequent paths and reducing the amount of calculation.

[0018] In some optional implementations, determining the target path based on the first path after iteration includes:

[0019] The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

[0020] In the above solution, since the indicator constraint of the first indicator is the shortest path, the target path that meets the constraints of the first indicator and the second indicator is obtained by selecting the first path after iteration corresponding to the minimum value of the indicator information.

[0021] In some optional implementations, before determining the sum of the first target indicator information and the second target indicator information of the target indicator, the method further includes:

[0022] Determine that the indicator information of the second path in the second indicator does not satisfy the corresponding indicator constraint, and the indicator information of the third path in the second indicator satisfies the corresponding indicator constraint; wherein, the second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

[0023] The above scheme, for the constrained shortest path problem (the constraint of the first indicator is the shortest path, and the constraints of the remaining second indicators are specified limits), does not directly iterate the path selection, but first obtains the second path with the shortest first indicator. If the second path already meets the constraint of the second indicator, the second path can be directly used as the target path, avoiding the complicated iterative process; in addition, the third path with the shortest second indicator is obtained, and it is determined whether the third path meets the constraint of the second indicator. If none of the third paths meet the constraint of the second indicator, it means that there is no target path that meets the constraint of the third indicator, and there is no need for iterative path selection, further improving the iteration efficiency.

[0024] In some optional implementations, the initial cost limit is a preset value or indicator information of the third path in the first indicator.

[0025] Some optional implementations further include:

[0026] If the indicator information of the second path in the second indicator meets the corresponding indicator constraint, the second path is determined as the target path.

[0027] In the above scheme, the second path is the path with the shortest first indicator. If the second path already meets the constraint of the second indicator, the first path can be directly used as the target path. When the second path does not meet the constraint of the second indicator, the path selection can be iterated to improve routing efficiency.

[0028] Some optional implementations further include:

[0029] If the indicator information of the third path in the second indicator does not satisfy the corresponding indicator constraint, it is determined that the target path does not exist.

[0030] In the above solution, the third path is the path with the shortest second index. If the third path does not meet the second index constraint, it means that there is no target path that meets the second index constraint.

[0031] In some optional implementations, the adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

[0032] In a second aspect, an embodiment of the present application provides a routing device, including:

[0033] An indicator information determination module is configured to determine, for any target indicator, the sum of first target indicator information and second target indicator information for the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is a shortest path and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information for the target indicator between an adjacent node and a destination node, and the second target indicator information is the indicator information for the target indicator after the adjacent node is added to the first path of the current iteration;

[0034] a constraint module, configured to iterate the first path based on the adjacent nodes, and update the cost limit based on the adjacent nodes, if the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator;

[0035] The path determination module is used to determine a target path based on the first path after the iteration is completed; wherein the last hop node of the first path after the iteration is completed is the destination node.

[0036] In some optional implementations, the constraint module is specifically configured to:

[0037] The adjacent node is added to the first path of the current iteration to obtain an updated first path.

[0038] In some optional implementations, after obtaining the updated first path, the constraint module is further configured to:

[0039] For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

[0040] In some optional implementations, the constraint module is specifically configured to:

[0041] The minimum value of the target cumulative information of the first indicator in all first paths of the current iteration is determined as the new cost limit; wherein, the target cumulative information is the sum of the indicator information of the first indicator corresponding to the time when the second indicator is shortest between the adjacent node and the destination node, and the indicator information of the first indicator after the adjacent node is added to the first path of the current iteration.

[0042] In some optional implementations, the path determination module is specifically configured to:

[0043] The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

[0044] In some optional implementations, before the indicator information determination module determines the sum of the first target indicator information and the second target indicator information of the target indicator, the constraint module is further configured to:

[0045] Determine that the indicator information of the second path in the second indicator does not satisfy the corresponding indicator constraint, and the indicator information of the third path in the second indicator satisfies the corresponding indicator constraint; wherein, the second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

[0046] In some optional implementations, the initial cost limit is a preset value or indicator information of the third path in the first indicator.

[0047] In some optional implementations, the path determination module is further configured to:

[0048] If the indicator information of the second path in the second indicator meets the corresponding indicator constraint, the second path is determined as the target path.

[0049] In some optional implementations, the path determination module is further configured to:

[0050] If the indicator information of the third path in the second indicator does not satisfy the corresponding indicator constraint, it is determined that the target path does not exist.

[0051] In some optional implementations, the adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

[0052] In a third aspect, an embodiment of the present application provides a control device, including a processor and a memory;

[0053] The memory stores program code, and when the program code is executed by the processor, the processor executes the routing method as described in any one of the first aspects.

[0054] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the routing method as described in any one of the first aspects is implemented.

[0055] In addition, the technical effects brought about by any implementation method in the second to fourth aspects can refer to the technical effects brought about by different implementation methods in the first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0057] Figure 1 A schematic flow chart of the first routing method provided in an embodiment of the present application;

[0058] Figure 2 A solution interval diagram provided for an embodiment of the present application;

[0059] Figure 3 A schematic flow chart of the second routing method provided in an embodiment of the present application;

[0060] Figure 4 A schematic flow chart of a third routing method provided in an embodiment of the present application;

[0061] Figure 5 A schematic flow chart of the fourth routing method provided in an embodiment of the present application;

[0062] Figure 6 A schematic diagram of the structure of a routing device provided in an embodiment of the present application;

[0063] Figure 7 A schematic block diagram of a control device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0064] To make the objectives, technical solutions, and advantages of this application more clear, this application will be further described in detail below with reference to the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making any creative efforts are within the scope of protection of this application.

[0065] The terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of the technical features being referred to. Thus, a feature specified as "first" or "second" may explicitly or implicitly include one or more of such features. Throughout this application, unless otherwise specified, "plurality" means two or more.

[0066] In the description of this application, unless otherwise specified or limited, the term "connection" should be understood in a broad sense. For example, it can mean direct connection, indirect connection through an intermediate medium, or internal communication between two devices. Those skilled in the art will understand the specific meaning of the above terms in this application based on the specific circumstances.

[0067] Routing is a fundamental network layer function in communications networks, determining the path from a source node to a destination node through a series of intermediate switching nodes. QoS is a key requirement in many communications network settings and applications. QoS routing involves selecting a feasible path within the network that meets the various QoS requirements of an application.

[0068] The emergence of SDN technology has transformed the traditional network control model, introducing a centralized network controller that manages and configures the entire network. This centralized control model makes the distribution of switching states more flexible and programmable, better supporting dynamic network adjustment and optimization.

[0069] In related technologies, an iterative optimization algorithm is used to calculate paths to approach the optimal solution, and network performance indicators are optimized by continuously adjusting routing weights or paths, such as minimizing delay or minimizing maximum bandwidth utilization.

[0070] However, the above method has a slow calculation speed and cannot meet the real-time requirements.

[0071] Based on this, an embodiment of the present application provides a routing method, apparatus, control device and storage medium, which is applied to a control device, including: for any target indicator, determining the sum of the first target indicator information and the second target indicator information of the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is the shortest path, and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the adjacent node is added to the first path of the current iteration; if the sum of the indicator information of the second indicator meets the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator meets the cost limit of the first indicator, then iterating the first path based on the adjacent node, and updating the cost limit based on the adjacent node; determining the target path based on the first path after the iteration is completed; wherein the last hop node of the first path after the iteration is completed is the destination node.

[0072] In the above scheme, during the iterative routing process, for the adjacent nodes that are not in the first path of the current iteration, it is first determined whether the constraints of the second indicator and the cost limit of the first indicator are met after adding the adjacent node. The adjacent node will be added only if both conditions are met. If not, the adjacent node will be skipped, so that the first path after the iteration is completed can meet the requirements of the second indicator, and the indicator information (accumulated value) of the first indicator can be reduced as much as possible, reducing the calculation process and improving the iteration efficiency.

[0073] The following will be combined with the accompanying drawings and specific embodiments to explain in detail the technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments.

[0074] The embodiment of the present application provides a first routing method, which is applied to a control device, such as Figure 1 As shown, the method may include:

[0075] Step S101: for any target indicator, determine the sum of the first target indicator information and the second target indicator information of the target indicator.

[0076] The target indicator includes a first indicator whose indicator constraint is a shortest path, and a second indicator whose indicator constraint is a constraint value;

[0077] The first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the first path of the current iteration is added to the adjacent node.

[0078] In this embodiment, for the constrained shortest path problem (the constraint of the first indicator is the shortest path, and the constraints of the remaining second indicators are specified limits), such as the single-constrained shortest path problem (one second indicator) or the multi-constrained shortest path problem (multiple second indicators), each target indicator has corresponding constraints and restrictions. Based on this, it is necessary to determine the indicator information of the target indicator between the adjacent node and the destination node, and the sum of the indicator information of the target indicator after the adjacent node is added to the first path of the current iteration, that is, under the target indicator, the minimum achievable cumulative value if the adjacent node is added.

[0079] The indicator information of the target indicator between the adjacent node and the destination node is the minimum value of the target indicator (the indicator information corresponding to the path with the shortest first indicator from the adjacent node to the destination node); the indicator information of the target indicator after the first path of the current iteration is added to the adjacent node is the accumulated value of the target indicator.

[0080] In some optional implementations, the adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

[0081] Step S102: If the sum of the indicator information of the second indicator meets the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator meets the cost limit of the first indicator, then iterate the first path based on the adjacent nodes, and update the cost limit based on the adjacent nodes.

[0082] In this embodiment, during the iterative routing process, for adjacent nodes that are not in the first path of the current iteration, it is first determined whether adding the adjacent node satisfies the constraints of the second indicator and the cost limit of the first indicator. The adjacent node will be added only if both conditions are met.

[0083] See Figure 2 As shown, C1 is the indicator information of the first indicator corresponding to the path with the shortest first indicator, and C2 is the cost limit of the first indicator; X1 is the indicator information of the second indicator corresponding to the path with the shortest second indicator, and X2 is the constraint value of the second indicator. The entire area constitutes the search interval of the iterative process.

[0084] In practice, if the cost limit is larger, the search range is larger. Based on this, this embodiment dynamically updates the cost limit.

[0085] In addition, in order to improve the iteration efficiency, multiple parallel threads can be set to divide C1 to C2 into multiple intervals, and different intervals are iteratively calculated through different threads.

[0086] Step S103: determining a target path based on the first path after the iteration; wherein the last hop node of the first path after the iteration is the destination node.

[0087] In the above scheme, during the iterative routing process, for the adjacent nodes that are not in the first path of the current iteration, it is first determined whether the constraints of the second indicator and the cost limit of the first indicator are satisfied after adding the adjacent node. The adjacent node will be added only if both conditions are satisfied. If not, the adjacent node will be skipped, so that the first path after the iteration is completed can meet the requirements of the second indicator, and the indicator information (accumulated value) of the first indicator can be reduced as much as possible, the calculation process is reduced, and the iteration efficiency is improved. The technical solution of the present application and how the technical solution of the present application solves the above technical problems will be described in detail below in conjunction with the accompanying drawings and specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments.

[0088] In some optional implementations, the updating of the first path in step S102 may be implemented by, but not limited to, the following methods:

[0089] The adjacent node is added to the first path of the current iteration to obtain an updated first path.

[0090] If the addition of the adjacent node satisfies the constraint of the second indicator and the cost limit of the first indicator, the adjacent node is added to the first path of the current iteration and iterates to the next hop node, thereby completing the next hop update of the first path.

[0091] Exemplarily, the source node is node S, the first path of the current iteration is node S-node A-node B, and after the adjacent node C meets the above conditions, it is added to the first path of the current iteration, and the updated first path is node S-node A-node B-node C.

[0092] In some optional implementations, after obtaining the updated first path, the following steps are further performed:

[0093] For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

[0094] In implementation, if the last hop node of the current iteration of multiple first paths is the same, some first paths can be filtered out by comparing the indicator information of the multiple first paths in the target indicator, thereby reducing the subsequent iteration process.

[0095] Exemplarily, all first paths whose last hop is the adjacent node are determined. If the indicator information of the first path A in each target indicator is smaller than the indicator information of the first path B in each target indicator, the first path B is filtered.

[0096] That is to say, for the above-mentioned updated first path, if the indicator information of at least one target indicator is smaller than a candidate path of the adjacent node (the last hop node is any first path of the adjacent node), the updated first path will be added to the candidate path of the adjacent node, and the candidate paths whose indicator information of each target indicator is greater than that of the updated first path will be filtered; conversely, if the indicator information of each target indicator is greater than or equal to a candidate path of the adjacent node, the updated first path will not be added to the candidate path of the adjacent node.

[0097] In some optional implementations, the updating of the cost limit in step S102 may be implemented by, but not limited to, the following methods:

[0098] Determine the minimum value of the target cumulative information of the first indicator in all first paths of the current iteration as a new cost limit;

[0099] The target cumulative information is the sum of the index information of the first index corresponding to the time when the second index is shortest between the adjacent node and the destination node, and the index information of the first index after the adjacent node is added to the first path of the current iteration.

[0100] During implementation, if the cost limit is larger, the search range is larger. Based on this, this embodiment dynamically updates the cost limit by determining the minimum value of the sum of the indicator information of the first indicator as the new cost limit, so that the cost limit is further reduced, thereby increasing the screening of subsequent paths and reducing the amount of calculation.

[0101] In some optional implementations, the above step S103 may be implemented by, but not limited to, the following methods:

[0102] The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

[0103] Since the indicator constraint of the first indicator is the shortest path, the target path that meets the constraints of the first indicator and the second indicator is obtained by selecting the first path after iteration corresponding to the minimum value of the indicator information.

[0104] During implementation, there may be multiple minimum values ​​of indicator information. The path with the shortest second indicator among these first paths can be used as the target path.

[0105] The embodiment of the present application provides a second routing method, such as Figure 3 As shown, the method may include:

[0106] Step S301: Determine whether the indicator information of the second path at the second indicator satisfies the corresponding indicator constraint, and whether the indicator information of the third path at the second indicator satisfies the corresponding indicator constraint.

[0107] The second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

[0108] In this embodiment, for constrained shortest path problems (the constraint of the first indicator is the shortest path, and the constraints of the remaining second indicators are specified limits), such as a single-constrained shortest path problem (one second indicator) or a multi-constrained shortest path problem (multiple second indicators), the essence is to select the path with the shortest first indicator under the constraint of the second indicator; if the second path with the shortest first indicator already satisfies the constraint of the second indicator, then there is no need for iterative path selection.

[0109] In addition, before iteratively selecting the target path, a third path with the shortest second index is obtained, and it is determined whether the third path meets the second index constraint. If none of the third paths meet the second index constraint, it means that there is no target path that meets the second index constraint, and no iterative path selection is required.

[0110] Based on this, this embodiment does not directly iterate path selection. Instead, it first obtains the second path with the shortest first metric and the third path with the shortest second metric. If the second path already satisfies the second metric constraint, the first path can be directly used as the target path. If none of the third paths satisfy the second metric constraint, it is directly determined that no target path that does satisfy the second metric constraint exists. Iterative path selection is performed only when both conditions are not met.

[0111] In implementation, the single-metric shortest paths from each node to all other nodes under different metrics can be cached. In this way, the second path and the third path can be directly determined. The cached data can be shown in Table 1 below:

[0112] Table 1

[0113]

[0114] When obtaining the cache, you can directly search using the source node field and indicator to obtain the single-indicator shortest path from the source node to the destination node.

[0115] Because network conditions may change, the cached data may need to be updated. The corresponding update strategy can be determined based on the cost type of each metric. For example, a real-time update strategy may be adopted for metrics with minimal changes, such as TE cost, while a scheduled update strategy may be adopted for metrics with frequent changes. Of course, updates can also be triggered based on user selections. This embodiment does not specifically limit this.

[0116] Step S302: If the indicator information of the second indicator of the second path does not meet the corresponding indicator constraint, and the indicator information of the second indicator of the third path meets the corresponding indicator constraint, then for any target indicator, determine the sum of the first target indicator information and the second target indicator information of the target indicator.

[0117] The target indicator includes a first indicator whose indicator constraint is a shortest path, and a second indicator whose indicator constraint is a constraint value;

[0118] The first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the first path of the current iteration is added to the adjacent node.

[0119] Step S303: If the sum of the indicator information of the second indicator meets the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator meets the cost limit of the first indicator, then iterate the first path based on the adjacent nodes, and update the cost limit based on the adjacent nodes.

[0120] Step S304: determining a target path based on the first path after the iteration; wherein the last hop node of the first path after the iteration is the destination node.

[0121] The specific implementation of steps S302 to S304 can refer to the above embodiment and will not be repeated here.

[0122] The above scheme, for the constrained shortest path problem (the constraint of the first indicator is the shortest path, and the constraints of the remaining second indicators are specified limits, that is, the indicator constraints are constraint value constraints), does not directly iterate the path selection, but first obtains the second path with the shortest first indicator. If the second path already meets the constraint of the second indicator (less than or equal to the constraint value corresponding to the second indicator), the second path can be directly used as the target path, avoiding the complicated iterative process; in addition, the third path with the shortest second indicator is obtained, and it is determined whether the third path meets the second indicator constraint. If none of the third paths meet the second indicator constraint (greater than the constraint value corresponding to the second indicator), it means that there is no target path that meets the third indicator constraint, and there is no need to iterate the path selection, further improving the iteration efficiency.

[0123] In some optional implementations, the initial cost limit is a preset value or indicator information of the third path in the first indicator.

[0124] Because the indicator information of the third path in the first indicator is the only indicator information of the first indicator that can be determined to satisfy the second indicator before iteration, it can be used as the initial cost limit. Alternatively, it can be directly set to a preset value.

[0125] The present application embodiment provides a third routing method, such as Figure 4 As shown, the method may include:

[0126] Step S401: Determine whether the indicator information of the second path at the second indicator satisfies the corresponding indicator constraint.

[0127] Step S402: If satisfied, the second path is determined as the target path.

[0128] In the above scheme, the second path is the path with the shortest first indicator. If the second path already meets the constraint of the second indicator, the first path can be directly used as the target path. When the second path does not meet the constraint of the second indicator, the path selection can be iterated to improve routing efficiency.

[0129] The present application embodiment provides a fourth routing method, such as Figure 5 As shown, the method may include:

[0130] Step S501: Determine whether the indicator information of the third path in the second indicator meets the corresponding indicator constraint.

[0131] Step S502: If not satisfied, it is determined that the target path does not exist.

[0132] In the above solution, the third path is the path with the shortest second index. If the third path does not meet the second index constraint, it means that there is no target path that meets the second index constraint.

[0133] like Figure 6 As shown, based on the same inventive concept, an embodiment of the present application provides a routing device 600, including:

[0134] The indicator information determination module 601 is configured to determine, for any target indicator, the sum of first target indicator information and second target indicator information for the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is the shortest path and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information for the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information for the target indicator after the adjacent node is added to the first path of the current iteration;

[0135] a constraint module 602 configured to iterate the first path based on the adjacent nodes and update the cost limit based on the adjacent nodes if the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator;

[0136] The path determination module 603 is configured to determine a target path based on the first path after the iteration is completed; wherein the last hop node of the first path after the iteration is completed is the destination node.

[0137] In some optional implementations, the constraint module 602 is specifically configured to:

[0138] The adjacent node is added to the first path of the current iteration to obtain an updated first path.

[0139] In some optional implementations, after obtaining the updated first path, the constraint module 602 is further configured to:

[0140] For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

[0141] In some optional implementations, the constraint module 602 is specifically configured to:

[0142] The minimum value of the target cumulative information of the first indicator in all first paths of the current iteration is determined as the new cost limit; wherein, the target cumulative information is the sum of the indicator information of the first indicator corresponding to the time when the second indicator is shortest between the adjacent node and the destination node, and the indicator information of the first indicator after the adjacent node is added to the first path of the current iteration.

[0143] In some optional implementations, the path determination module 603 is specifically configured to:

[0144] The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

[0145] In some optional implementations, before the indicator information determination module 601 determines the sum of the first target indicator information and the second target indicator information of the target indicator, the constraint module 602 is further configured to:

[0146] Determine that the indicator information of the second path in the second indicator does not satisfy the corresponding indicator constraint, and the indicator information of the third path in the second indicator satisfies the corresponding indicator constraint; wherein, the second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

[0147] In some optional implementations, the initial cost limit is a preset value or indicator information of the third path in the first indicator.

[0148] In some optional implementations, the path determination module 603 is further configured to:

[0149] If the indicator information of the second path in the second indicator meets the corresponding indicator constraint, the second path is determined as the target path.

[0150] In some optional implementations, the path determination module 603 is further configured to:

[0151] If the indicator information of the third path in the second indicator does not satisfy the corresponding indicator constraint, it is determined that the target path does not exist.

[0152] In some optional implementations, the adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

[0153] Since the device is the device in the method in the embodiment of the present application, and the principle of solving the problem by the device is similar to that of the method, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be repeated.

[0154] like Figure 7 As shown, based on the same inventive concept, the embodiment of the present application provides a control device 700, such as Figure 7 As shown, it includes at least one processor 701 and a memory 702 connected to the at least one processor. The specific connection medium between the processor 701 and the memory 702 is not limited in the embodiment of the present application. Figure 7 For example, the processor 701 and the memory 702 are connected via a bus 703. Buses can be divided into path buses, data buses, control buses, etc. For ease of representation, Figure 7 Only one thick line is used in the diagram, but this does not mean that there is only one bus or one type of bus.

[0155] Among them, the processor 701 is the control center of the control device, which can use various interfaces and lines to connect various parts of the control device, and realize data processing by running or executing instructions stored in the memory 702 and calling data stored in the memory 702. Optionally, the processor 701 may include one or more processing units. The processor 701 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, etc., and the modem processor mainly processes the issuance of instructions. It is understandable that the above-mentioned modem processor may not be integrated into the processor 701. In some embodiments, the processor 701 and the memory 702 may be implemented on the same chip. In some embodiments, they may also be implemented separately on independent chips.

[0156] The processor 701 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit (ASIC), a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in conjunction with the routing method embodiment can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor.

[0157] The memory 702 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 702 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 702 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 702 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0158] In the embodiment of the present application, the memory 702 stores a computer program. When the program is executed by the processor 701, the processor 701 executes:

[0159] For any target indicator, determine the sum of first target indicator information and second target indicator information of the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is the shortest path, and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the adjacent node is added to the first path of the current iteration;

[0160] If the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator, iterating the first path based on the adjacent nodes, and updating the cost limit based on the adjacent nodes;

[0161] Based on the first path after the iteration, a target path is determined; wherein the last hop node of the first path after the iteration is the destination node.

[0162] In some optional implementations, the processor 701 specifically performs:

[0163] The adjacent node is added to the first path of the current iteration to obtain an updated first path.

[0164] In some optional implementations, after obtaining the updated first path, the processor 701 is further configured to:

[0165] For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

[0166] In some optional implementations, the processor 701 specifically performs:

[0167] The minimum value of the target cumulative information of the first indicator in all first paths of the current iteration is determined as the new cost limit; wherein, the target cumulative information is the sum of the indicator information of the first indicator corresponding to the time when the second indicator is shortest between the adjacent node and the destination node, and the indicator information of the first indicator after the adjacent node is added to the first path of the current iteration.

[0168] In some optional implementations, the processor 701 specifically performs:

[0169] The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

[0170] In some optional implementations, before determining the sum of the first target indicator information and the second target indicator information of the target indicator, the processor 701 further executes:

[0171] Determine that the indicator information of the second path in the second indicator does not satisfy the corresponding indicator constraint, and the indicator information of the third path in the second indicator satisfies the corresponding indicator constraint; wherein, the second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

[0172] In some optional implementations, the initial cost limit is a preset value or indicator information of the third path in the first indicator.

[0173] In some optional implementations, the processor 701 further executes:

[0174] If the indicator information of the second path in the second indicator meets the corresponding indicator constraint, the second path is determined as the target path.

[0175] In some optional implementations, the processor 701 further executes:

[0176] If the indicator information of the third path in the second indicator does not satisfy the corresponding indicator constraint, it is determined that the target path does not exist.

[0177] In some optional implementations, the adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

[0178] Since the control device is the control device that executes the method in the embodiment of the present application, and the principle of solving the problem by the control device is similar to that of the method, the implementation of the control device can refer to the implementation of the method, and the repeated parts will not be repeated.

[0179] The embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-mentioned routing method.

[0180] The present application is described above with reference to block diagrams and / or flow charts illustrating methods, devices (systems) and / or computer program products according to embodiments of the present application. It should be understood that a block of a block diagram and / or flow chart, as well as a combination of blocks of a block diagram and / or flow chart, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer and / or other programmable device to produce a machine, so that the instructions executed by the computer processor and / or other programmable device create a method for implementing the functions / actions specified in the block diagram and / or flow chart block.

[0181] Accordingly, the present application may also be implemented using hardware and / or software (including firmware, resident software, microcode, etc.). Furthermore, the present application may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in conjunction with an instruction execution system. In the context of the present application, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, transmit, or convey a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0182] Although the preferred embodiments of the present application have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present application.

[0183] Obviously, those skilled in the art may make various changes and modifications to this application without departing from the spirit and scope of this application. Thus, if these modifications and variations of this application fall within the scope of the claims of this application and their equivalents, this application is intended to include these modifications and variations.

Claims

1. A routing method, characterized in that: The method comprises: For any target indicator, determine the sum of first target indicator information and second target indicator information of the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is the shortest path, and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information of the target indicator between the adjacent node and the destination node, and the second target indicator information is the indicator information of the target indicator after the adjacent node is added to the first path of the current iteration; If the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator, and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator, iterating the first path based on the adjacent nodes, and updating the cost limit based on the adjacent nodes; Based on the first path after the iteration, a target path is determined; wherein the last hop node of the first path after the iteration is the destination node.

2. The method according to claim 1, wherein Iterating the first path based on the adjacent nodes includes: The adjacent node is added to the first path of the current iteration to obtain an updated first path.

3. The method according to claim 2, wherein After obtaining the updated first path, the following steps are also included: For any first path whose last hop node is the adjacent node, if there is another first path whose indicator information for each target indicator is smaller than the indicator information of the first path for the same target indicator, the first path is filtered.

4. The method according to claim 1, wherein Updating the cost limit based on the adjacent node includes: Determine the minimum value of the target cumulative information of the first indicator in all first paths of the current iteration as a new cost limit; The accumulated information is the sum of the index information of the first index corresponding to the time when the second index is shortest between the adjacent node and the destination node, and the index information of the first index after the adjacent node is added to the first path of the current iteration.

5. The method according to claim 1, wherein Based on the first path after the iteration, determine the target path, including: The indicator information of the first indicator corresponding to the first path after each iteration is completed is determined, and the first path after the iteration corresponding to the minimum value of the indicator information is determined as the target path.

6. The method according to claim 1, wherein Before determining the sum of the first target indicator information and the second target indicator information of the target indicator, the method further includes: Determine that the indicator information of the second path in the second indicator does not satisfy the corresponding indicator constraint, and the indicator information of the third path in the second indicator satisfies the corresponding indicator constraint; wherein, the second path is the path with the shortest first indicator; and the third path is the path with the shortest second indicator.

7. The method according to claim 6, wherein The initial cost limit is a preset value or the indicator information of the third path in the first indicator.

8. The method according to claim 6, wherein Also includes: If the indicator information of the second path in the second indicator meets the corresponding indicator constraint, the second path is determined as the target path.

9. The method according to claim 6, wherein Also includes: If the indicator information of the third path in the second indicator does not satisfy the corresponding indicator constraint, it is determined that the target path does not exist.

10. The method according to any one of claims 1 to 9, characterized in that: The adjacent node is a node that is not in the first path of the current iteration and is adjacent to the last hop node in the first path of the current iteration.

11. A routing device, characterized in that: The device includes: An indicator information determination module is configured to determine, for any target indicator, the sum of first target indicator information and second target indicator information for the target indicator; wherein the target indicator includes a first indicator whose indicator constraint is a shortest path and a second indicator whose indicator constraint is a constraint value; the first target indicator information is the indicator information for the target indicator between an adjacent node and a destination node, and the second target indicator information is the indicator information for the target indicator after the adjacent node is added to the first path of the current iteration; a constraint module, configured to iterate the first path based on the adjacent nodes, and update the cost limit based on the adjacent nodes, if the sum of the indicator information of the second indicator satisfies the indicator constraint of the second indicator and the sum of the indicator information of the first indicator satisfies the cost limit of the first indicator; The path determination module is used to determine a target path based on the first path after the iteration is completed; wherein the last hop node of the first path after the iteration is completed is the destination node.

12. A control device, characterized in that: include: processor and memory; The memory stores program codes, and when the program codes are executed by the processor, the processor executes the routing method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the routing method according to any one of claims 1 to 10 is implemented.