Path planning method and apparatus, and server

Abstract

Disclosed are a path planning method and apparatus, and a server. The method comprises: calculating a network requirement indicator on the basis of acquired user-related information and system environment information, wherein the user-related information comprises an access service type and link information; when the network requirement indicator is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1, updating the current path on the basis of the user-related information and a path planning algorithm; and when the network requirement indicator is greater than the first threshold and less than the second threshold, if it is determined that the parameter difference between a parameter of the access service type and a parameter of the current path is greater than a preset difference, updating the current path on the basis of the user-related information and the path planning algorithm. Thus, targeted path planning based on user-related information is achieved, thereby improving the communication efficiency between nodes.

Description

A path planning method, apparatus and server

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202411570065.X, filed on November 5, 2024, entitled "A Path Planning Method, Apparatus and Server", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This invention relates to the field of network technology, and in particular to a path planning method, apparatus, and server. Background Technology

[0004] In the Internet of Things (IoT), node path planning is a crucial process for ensuring efficient communication, data transmission, and stable network operation. In modern network environments, users have diverse performance requirements for the security of access nodes and the types of services they access. To meet these varying needs, rational and effective node path planning is particularly important in multi-node networking systems.

[0005] However, traditional node path planning in existing technologies only considers shortening user access time and cannot perform targeted path planning, which leads to low communication efficiency between nodes. Summary of the Invention

[0006] This invention provides a path planning method, apparatus, and server to solve the problem that traditional node path planning in the prior art only considers shortening user access time and cannot perform targeted path planning, resulting in low communication efficiency between nodes.

[0007] In a first aspect, embodiments of this application provide a path planning method, the method comprising:

[0008] Based on the obtained user-related information and system environment information, network demand indicators are calculated, wherein the user-related information includes access service type and link information;

[0009] When the network demand index is greater than or equal to 0 and less than or equal to the first threshold, or greater than or equal to the second threshold and less than or equal to 1, the current path is updated based on the user-related information and the path planning algorithm.

[0010] If the network demand index is greater than a first threshold and less than a second threshold, and if the parameter difference between the access service type parameter and the current path parameter is greater than a preset difference, then the current path is updated based on the user-related information and the path planning algorithm.

[0011] In one possible implementation, calculating network demand indicators based on the acquired user-related information and system environment information includes:

[0012] Determine the network index value corresponding to the access service type, and determine the abnormal event index value corresponding to the system environment information;

[0013] After calculating the first value by multiplying the network index value by the current stability parameter, calculate the second value by dividing the first value by the preset stability parameter;

[0014] The sum of the second value and the abnormal event index value is used as the network demand indicator.

[0015] The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

[0016] In one possible implementation, updating the current path based on the user-related information and the path planning algorithm when the network demand index is greater than or equal to 0 and less than or equal to a first threshold includes:

[0017] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0018] Construct an adjacency matrix based on the standardized values ​​of each node;

[0019] The shortest path from the initial node to the destination node is determined based on the adjacency matrix and the path planning algorithm, and the current path is updated based on the shortest path.

[0020] In one possible implementation, updating the current path based on the user-related information and the path planning algorithm when the network demand index is greater than or equal to a second threshold and less than or equal to 1 includes:

[0021] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0022] Construct an adjacency matrix based on the standardized values ​​of each node;

[0023] The optimal path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm.

[0024] Using the latency and minimum bandwidth required for the access service type as evaluation criteria, the performance improvement value of the optimized path and the current path is determined based on the evaluation criteria.

[0025] If the performance improvement value is greater than or equal to a preset performance threshold, the current path is updated based on the optimized path.

[0026] In one possible implementation, the current stable parameter is obtained through the following steps:

[0027] The link information of each node is assigned a value based on a preset parameter lookup table;

[0028] The link information of each node after being assigned a value is logarithmically transformed to obtain the standardized value corresponding to the link information of each node;

[0029] The normalized values ​​are calculated based on a preset range to determine the normalized values ​​corresponding to the link information of each node.

[0030] The sum of the normalized values ​​of each node is used as the current stable parameter.

[0031] Secondly, embodiments of this application provide a path planning device, the device comprising:

[0032] The information acquisition module is used to calculate network demand indicators based on the acquired user-related information and system environment information, wherein the user-related information includes access service type and link information;

[0033] The path update module is used to update the current path based on the user-related information and the path planning algorithm when the network demand index is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; and when the network demand index is greater than the first threshold and less than the second threshold, if it is determined that the parameter difference between the access service type parameter and the parameter of the current path is greater than a preset difference, then the current path is updated based on the user-related information and the path planning algorithm.

[0034] In one possible implementation, the information acquisition module is specifically used for:

[0035] Determine the network index value corresponding to the access service type, and determine the abnormal event index value corresponding to the system environment information;

[0036] After calculating the first value by multiplying the network index value by the current stability parameter, calculate the second value by dividing the first value by the preset stability parameter;

[0037] The sum of the second value and the abnormal event index value is used as the network demand indicator.

[0038] The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

[0039] In one possible implementation, the path update module is specifically used for:

[0040] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0041] Construct an adjacency matrix based on the standardized values ​​of each node;

[0042] The shortest path from the initial node to the destination node is determined based on the adjacency matrix and the path planning algorithm, and the current path is updated based on the shortest path.

[0043] In one possible implementation, the path update module is specifically used for:

[0044] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0045] Construct an adjacency matrix based on the standardized values ​​of each node;

[0046] The optimal path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm.

[0047] Using the latency and minimum bandwidth required for the access service type as evaluation criteria, the performance improvement value of the optimized path and the current path is determined based on the evaluation criteria.

[0048] If the performance improvement value is greater than or equal to a preset performance threshold, the current path is updated based on the optimized path.

[0049] Thirdly, embodiments of this application provide a server including a memory and a processor, wherein the memory stores a computer program that runs on the processor, and when the computer program is executed by the processor, it implements the method as described in any one of the first aspects.

[0050] The beneficial effects of this invention are as follows:

[0051] This application provides a path planning method, apparatus, and server. The method includes: calculating network demand indicators based on acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; and updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than the first threshold and less than the second threshold, if the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, thereby achieving targeted path planning based on user-related information and improving communication efficiency between nodes. Attached Figure Description

[0052] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0053] Figure 1 is a flowchart illustrating a path planning method provided in an embodiment of this application;

[0054] Figure 2 is a flowchart illustrating a method for calculating network demand indicators provided in an embodiment of this application;

[0055] Figure 3 is a flowchart illustrating a method for calculating a current stable parameter according to an embodiment of this application;

[0056] Figure 4 is a flowchart illustrating another path planning method provided in an embodiment of this application;

[0057] Figure 5 is a flowchart illustrating another path planning method provided in an embodiment of this application;

[0058] Figure 6 is a schematic diagram of a path planning device provided in an embodiment of this application;

[0059] Figure 7 is a schematic diagram of the structure of a server provided in an embodiment of this application. Detailed Implementation

[0060] 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. Obviously, the described embodiments are only a part of the embodiments of this invention, and not all of them. Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention.

[0061] It should be noted that the terms "comprising" and "having" and their variations used in this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units that are explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to such process, method, product, or device.

[0062] The terms "first" and "second" used in this document are for descriptive purposes only and should not be construed as indicating relative importance or implying the number of technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the embodiments of this application, unless otherwise stated, "multiple" means two or more.

[0063] The word “exemplary” as used below means “serving as an example, embodiment, or illustration.” Any embodiment illustrated as an “exemplary” need not be construed as superior to or better than other embodiments.

[0064] In the Internet of Things (IoT), node path planning is a crucial process for ensuring efficient communication, data transmission, and stable network operation. In modern network environments, users have diverse performance requirements for the security of access nodes and the types of services they access. To meet these varying needs, rational and effective node path planning is particularly important in multi-node networking systems.

[0065] However, traditional node path planning in existing technologies only considers shortening user access time and cannot perform targeted path planning, which leads to low communication efficiency between nodes.

[0066] Based on the above problems, Figure 1 shows a flowchart of a path planning method provided in an embodiment of this application. The steps of the method are as follows:

[0067] S101. Based on the obtained user-related information and system environment information, calculate network demand indicators, where user-related information includes access service type and link information;

[0068] Specifically, user-related information includes access service type and link information. The access service type includes high-performance access service and high-stability access service. The link information includes bandwidth, latency, jitter, and other information for each node in the user's current path. The system environment information is used to characterize abnormal events in the system environment and within the system.

[0069] S102. When the network demand index is greater than or equal to 0 and less than or equal to the first threshold, or greater than or equal to the second threshold and less than or equal to 1, update the current path based on user-related information and path planning algorithm.

[0070] S103. If the network demand index is greater than the first threshold and less than the second threshold, and the difference between the parameter of the access service type and the parameter of the current path is greater than the preset difference, then the current path is updated based on the user-related information and the path planning algorithm.

[0071] This application provides a path planning method, which includes: calculating network demand indicators based on acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; and updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than the first threshold and less than the second threshold, if the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, thereby achieving targeted path planning based on user-related information and improving the communication efficiency between nodes.

[0072] In one possible approach, as shown in Figure 2, a flowchart illustrating a method for calculating network demand metrics according to an embodiment of this application is presented. The specific steps are as follows:

[0073] S201. Determine the network index value Ls corresponding to the access service type, and determine the abnormal event index value Lc corresponding to the system environment information;

[0074] S202. After calculating the first value of the network index value Ls multiplied by the current stability parameter A1, calculate the second value of the first value divided by the preset stability parameter A2.

[0075] S203. The sum of the second value and the abnormal event index value Lc is used as the network demand index P.

[0076] The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

[0077] The formula for calculating the network demand index P is as follows:

[0078] In a specific embodiment, the network index value Ls is a pre-set value corresponding to the access service type, and the abnormal event index value Lc is the historical access abnormal event index for this access service type. The abnormal events include link interruption and node disconnection.

[0079] For example, if the network index value Ls corresponding to the access service type is known to be 2, the abnormal event index value Lc corresponding to the system environment information is known to be 0.1, the current stability parameter A1 is known to be 2.5, and the preset stability parameter A2 is known to be 8, then the calculated network demand index is...

[0080] In one possible implementation, as shown in Figure 3, which is a flowchart illustrating a method for calculating a current stable parameter according to an embodiment of this application, the parameter is obtained through the following steps:

[0081] S301. Assign values ​​to the link information of each node based on a preset parameter lookup table;

[0082] Specifically, for example, if the link information includes four nodes, namely 10M bandwidth, 100M bandwidth, 100ms latency, and 10ms latency, and the known preset parameter reference table is to set the link information of 10M bandwidth to 0.1, the link information of 100M bandwidth to 0.01, the link information of 100ms latency to 0.1, and the link information of 10ms latency to 0.001, then the four link information after assignment will be 0.1, 0.01, 0.1, and 0.001 respectively.

[0083] S302. Perform a logarithmic transformation on the link information of each node after assigning values ​​to obtain the standardized value corresponding to the link information of each node.

[0084] Specifically, the four link information values ​​obtained after assignment are 0.1, 0.01, 0.1, and 0.001. Each link information is then logarithmically transformed to obtain the standardized value corresponding to the link information of each node. If the preset logarithmic transformation is to take the base-10 logarithm, then the standardized value corresponding to 10M bandwidth is log_10(0.1) = -1, the standardized value corresponding to 100M bandwidth is log_10(0.01) = -2, the standardized value corresponding to 100ms latency is log_10(0.1) = -1, and the standardized value corresponding to 10ms latency is log_10(0.001) = -3.

[0085] S303. Calculate the normalized value corresponding to the link information of each node based on the standardized value within a preset range;

[0086] Specifically, the obtained standardized values ​​are -1, -2, -1, and -3. If the preset interval is [0,1], then the normalized values ​​are calculated based on the preset interval. The formula for calculating the normalized values ​​is as follows:

[0087] Normalized value = (standardized value - minimum value among standardized values) / (maximum value among standardized values ​​- minimum value among standardized values).

[0088] From the obtained normalized values ​​of -1, -2, -1, and -3, we know that the minimum normalized value is -3 and the maximum normalized value is -1. That is, the normalized value corresponding to 10M bandwidth is 1, the normalized value corresponding to 100M bandwidth is 0.5, the normalized value corresponding to 100ms latency is 1, and the normalized value corresponding to 10ms latency is 0.

[0089] S304. The sum of the normalized values ​​of each node is used as the current stable parameter.

[0090] Specifically, based on the normalized values ​​of the four nodes being 1, 0.5, 1, and 0, the sum of the normalized values ​​of the four nodes is calculated to be 2.5, meaning the current stable parameter A1 is 2.5.

[0091] In one possible implementation, as shown in Figure 4, which is a flowchart of another path planning method provided in this application embodiment, when the network demand index is greater than or equal to 0 and less than or equal to a first threshold, the current path is updated based on user-related information and the path planning algorithm. The steps are as follows:

[0092] S401. Standardize the link information of each node to obtain the standardized value corresponding to the link information of each node.

[0093] S402. Construct an adjacency matrix based on the standardized values ​​of each node;

[0094] S403. Determine the shortest path from the initial node to the destination node based on the adjacency matrix and path planning algorithm, and update the current path based on the shortest path.

[0095] It should be noted that when the network demand metric P is greater than or equal to 0 and less than or equal to the first threshold, it indicates that the user's access service is under high-performance demand. After standardizing the link information of each node in real time, the shortest path is determined based on the path planning algorithm, and the current path is updated based on the shortest path to achieve optimal performance.

[0096] Specifically, the path planning algorithm can be Dijkstra's algorithm.

[0097] For example, if the first threshold is 0.3 and the calculated network demand index P is 0.2, it indicates that the user's access service is under high-performance demand. By standardizing the link information of each node, standardized values ​​are obtained for each node's link information. Specifically, for example, if the link information of four nodes is 10M bandwidth, 100M bandwidth, 100ms latency, and 10ms latency, and the known preset parameter lookup table assigns a value of 0.1 to the 10M bandwidth link information, 0.2 to the 100M bandwidth link information, 0.1 to the 10ms latency link information, and 0.3 to the 10ms latency link information, the assigned values ​​for the four link information are 0.1, 0.2, 0.1, and 0.3. After constructing an adjacency matrix based on the assigned link information, the shortest path from the initial node to the destination node is determined based on the adjacency matrix and Dijkstra's algorithm, and the current path is updated based on the shortest path.

[0098] In one possible implementation, as shown in Figure 5, which is a flowchart of another path planning method provided in this application embodiment, when the network demand index is greater than or equal to a second threshold and less than or equal to 1, the current path is updated based on user-related information and the path planning algorithm. The steps are as follows:

[0099] S501. Standardize the link information of each node to obtain the standardized value corresponding to the link information of each node.

[0100] S502. Construct an adjacency matrix based on the standardized values ​​of each node;

[0101] S503. Based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm, determine the optimal path from the initial node to the destination node.

[0102] S504. Use the latency and minimum bandwidth required to access the service type as evaluation criteria, and determine the performance improvement value between the optimized path and the current path based on the evaluation criteria.

[0103] S505. If the performance improvement value is greater than or equal to the preset performance threshold, update the current path based on the optimized path.

[0104] It should be noted that when the network demand index P is greater than or equal to the second threshold and less than or equal to 1, it indicates that the user's access service is under high stability requirements. After periodically standardizing the link information of each node, an optimized path is determined based on the latency and minimum bandwidth required for the access service type and the path planning algorithm. The current path is updated when the performance improvement is greater than or equal to a preset performance threshold. The path planning algorithm can be Dijkstra's algorithm.

[0105] For example, if the second threshold is 0.7 and the calculated network demand index P is 0.8, it indicates that the user's access service is under high stability requirements. By standardizing the link information of each node, standardized values ​​are obtained for each node's link information. Specifically, for example, if the link information of four nodes is 10M bandwidth, 100M bandwidth, 100ms latency, and 10ms latency, and the known preset parameter reference table assigns a value of 0.1 to the 10M bandwidth link information, 0.2 to the 100M bandwidth link information, 0.1 to the 10ms latency link information, and 0.3 to the 10ms latency link information, then the assigned values ​​for the four link information are 0.1, 0.2, 0.1, and 0.3. After constructing an adjacency matrix based on the assigned link information, the optimal path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and Dijkstra's algorithm. The performance improvement value is compared with a preset performance threshold. If the performance improvement value is less than the preset performance threshold, the performance improvement of the optimized path is determined to be small, and the current path is not updated. If the performance improvement value is greater than or equal to the preset performance threshold, the performance improvement of the optimized path is determined to be large, and the current path is updated based on the optimized path.

[0106] In one possible implementation, if the network demand index is greater than a first threshold and less than a second threshold, and the difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, then the current path is updated based on user-related information and a path planning algorithm.

[0107] Specifically, the link information of each node is standardized to obtain the standardized value corresponding to the link information of each node;

[0108] Construct an adjacency matrix based on the standardized values ​​of each node;

[0109] The shortest path from the initial node to the destination node is determined based on the adjacency matrix and path planning algorithm, and the current path is updated based on the shortest path.

[0110] It should be noted that when the network demand index P is greater than the first threshold and less than the second threshold, it indicates that the user's access service is not under high performance or high stability requirements. The current path is updated based on the difference between the parameters of the access service type and the parameters of the current path, and the comparison between the parameter difference and the preset difference.

[0111] For example, a certain type of application might originally require 10M bandwidth or standard firewall-level security protection. However, due to user needs for enhanced protection, they might require increased security or bandwidth to 15M. This means the current path parameter is 10M bandwidth, and the access service type parameter is 15M bandwidth, resulting in a calculated parameter difference of 5M. If the preset difference is 3M, meaning the parameter difference is greater than the preset value, indicating significant parameter variation, the current path is updated based on user-related information and Dijkstra's algorithm. If the preset difference is less than 7M, meaning the parameter difference is less than the preset value, indicating minimal parameter variation, the current path is not updated to ensure stability.

[0112] Based on the same technical concept, this application also provides a path planning device. The principle of the path planning device in solving the problem is similar to that of the path planning method described above. Therefore, the implementation of the path planning device can refer to the implementation of the path planning method, and the repeated parts will not be described again.

[0113] Figure 6 shows a schematic diagram of a path planning device provided in an embodiment of this application. The device includes:

[0114] The information acquisition module 601 is used to calculate network demand indicators based on the acquired user-related information and system environment information, wherein the user-related information includes access service type and link information;

[0115] The path update module 602 is used to update the current path based on user-related information and a path planning algorithm when the network demand index is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; when the network demand index is greater than the first threshold and less than the second threshold, if the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, the current path is updated based on user-related information and a path planning algorithm.

[0116] This application provides a path planning method and apparatus, comprising: calculating a network demand index based on acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; updating the current path based on the user-related information and a path planning algorithm when the network demand index is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; and updating the current path based on the user-related information and the path planning algorithm when the network demand index is greater than the first threshold and less than the second threshold, if the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, thereby realizing targeted path planning based on user-related information and improving the communication efficiency between nodes.

[0117] In one possible implementation, the information acquisition module 601 is specifically used for:

[0118] Determine the network index value corresponding to the access service type, and determine the abnormal event index value corresponding to the system environment information;

[0119] After calculating the first value by multiplying the network index value by the current stability parameter, calculate the second value by dividing the first value by the preset stability parameter;

[0120] The sum of the second value and the abnormal event index value is used as the network demand indicator.

[0121] The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

[0122] In one possible implementation, the path update module 602 is specifically used for:

[0123] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0124] Construct an adjacency matrix based on the standardized values ​​of each node;

[0125] The shortest path from the initial node to the destination node is determined based on the adjacency matrix and path planning algorithm, and the current path is updated based on the shortest path.

[0126] In one possible implementation, the path update module 602 is specifically used for:

[0127] The link information of each node is standardized to obtain the standardized value corresponding to the link information of each node.

[0128] Construct an adjacency matrix based on the standardized values ​​of each node;

[0129] The optimal path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm.

[0130] The latency and minimum bandwidth required to access the service type are used as evaluation criteria, and the performance improvement value of the optimized path and the current path is determined based on the evaluation criteria.

[0131] If the performance improvement is greater than or equal to the preset performance threshold, the current path is updated based on the optimized path.

[0132] In one possible implementation, the path update module 602 is specifically used for:

[0133] The link information of each node is assigned a value based on a preset parameter lookup table;

[0134] The link information of each node after being assigned a value is logarithmically transformed to obtain the standardized value corresponding to the link information of each node;

[0135] The normalized values ​​are calculated based on a preset range to determine the normalized values ​​corresponding to the link information of each node.

[0136] The sum of the normalized values ​​of each node is used as the current stable parameter.

[0137] Based on the same technical concept, this application also provides a server. The principle of the server in solving the problem is similar to that of the path planning method and apparatus described above. Therefore, the implementation of the server can be referred to the implementation of the animation playback method, and the repeated parts will not be described again.

[0138] Figure 7 shows a schematic diagram of the structure of a server provided in an embodiment of this application, including a memory 701 and a processor 702. The memory 701 stores a computer program that runs on the processor 702. When the computer program is executed by the processor 702, the above-mentioned path planning method is implemented.

[0139] This application provides a path planning method, apparatus, and server. The method includes: calculating network demand indicators based on acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than or equal to 0 and less than or equal to a first threshold, or greater than or equal to a second threshold and less than or equal to 1; and updating the current path based on user-related information and a path planning algorithm when the network demand indicator is greater than the first threshold and less than the second threshold, if the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, thereby achieving targeted path planning based on user-related information and improving communication efficiency between nodes.

[0140] The present application has been described above with reference to block diagrams and / or flowcharts illustrating methods, apparatus (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 flowchart, as well as combinations of blocks of block diagrams and / or flowcharts, 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 data processing means to produce a machine, such that the instructions, executable via the computer processor and / or other programmable data processing means, create methods for implementing the functions / actions specified in the blocks of the block diagrams and / or flowcharts.

[0141] Accordingly, this application can also be implemented using hardware and / or software (including firmware, resident software, microcode, etc.). Furthermore, this application can 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 implemented in the medium for use by or in conjunction with an instruction execution system. In the context of this application, a computer-usable or computer-readable medium can be any medium that can contain, store, communicate, transmit, or deliver a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0142] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A path planning method, characterized in that, The method includes: Based on the obtained user-related information and system environment information, network demand indicators are calculated, wherein the user-related information includes access service type and link information; When the network demand index is greater than or equal to 0 and less than or equal to the first threshold, the link information of each node is standardized to obtain the standardized value corresponding to the link information of each node; an adjacency matrix is ​​constructed based on the standardized value of each node; the shortest path from the initial node to the destination node is determined based on the adjacency matrix and the path planning algorithm, and the current path is updated based on the shortest path; When the network demand index is greater than or equal to a second threshold and less than or equal to 1, the link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; an adjacency matrix is ​​constructed based on the standardized value of each node; an optimized path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm; the latency and minimum bandwidth required for the access service type are used as evaluation conditions, and the performance improvement value between the optimized path and the current path is determined based on the evaluation conditions; when the performance improvement value is greater than or equal to a preset performance threshold, the current path is updated based on the optimized path; If the network demand index is greater than a first threshold and less than a second threshold, and if the parameter difference between the access service type parameter and the current path parameter is greater than a preset difference, then the current path is updated based on the user-related information and the path planning algorithm.

2. The method as described in claim 1, characterized in that, The calculation of network demand indicators based on the acquired user-related information and system environment information includes: Determine the network index value corresponding to the access service type, and determine the abnormal event index value corresponding to the system environment information; After calculating the first value by multiplying the network index value by the current stability parameter, calculate the second value by dividing the first value by the preset stability parameter; The sum of the second value and the abnormal event index value is used as the network demand indicator. The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

3. The method as described in claim 1, characterized in that, The current stable parameters are obtained through the following steps: The link information of each node is assigned a value based on a preset parameter lookup table; The link information of each node after being assigned a value is logarithmically transformed to obtain the standardized value corresponding to the link information of each node; The normalized values ​​are calculated based on a preset range to determine the normalized values ​​corresponding to the link information of each node. The sum of the normalized values ​​of each node is used as the current stable parameter.

4. A path planning device, characterized in that, The device includes: The information acquisition module is used to calculate network demand indicators based on the acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; The path update module is used to standardize the link information of each node when the network demand index is greater than or equal to 0 and less than or equal to a first threshold, to obtain the standardized value corresponding to the link information of each node; construct an adjacency matrix based on the standardized value of each node; determine the shortest path from the initial node to the destination node based on the adjacency matrix and the path planning algorithm, and update the current path based on the shortest path. When the network demand index is greater than or equal to a second threshold and less than or equal to 1, the link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; an adjacency matrix is ​​constructed based on the standardized value of each node; an optimized path from the initial node to the destination node is determined based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm; the latency and minimum bandwidth required for the access service type are used as evaluation conditions, and the performance improvement value between the optimized path and the current path is determined based on the evaluation conditions; when the performance improvement value is greater than or equal to a preset performance threshold, the current path is updated based on the optimized path; If the network demand index is greater than a first threshold and less than a second threshold, and if the parameter difference between the access service type parameter and the current path parameter is greater than a preset difference, then the current path is updated based on the user-related information and the path planning algorithm.

5. The apparatus as described in claim 4, characterized in that, The information acquisition module is specifically used for: Determine the network index value corresponding to the access service type, and determine the abnormal event index value corresponding to the system environment information; After calculating the first value by multiplying the network index value by the current stability parameter, calculate the second value by dividing the first value by the preset stability parameter; The sum of the second value and the abnormal event index value is used as the network demand indicator. The current stable parameter is the sum of the link information of each node after standardization and normalization, and the preset stable parameter is the preset value corresponding to the access service type.

6. A server, characterized in that, It includes a memory and a processor, wherein the memory stores a computer program that runs on the processor, and when the computer program is executed by the processor, it implements the method of any one of claims 1 to 3.

Images