Path planning method, device and server

Abstract

The invention discloses a path planning method and device and a server, and the method comprises the steps: calculating a network demand index based on the obtained user related information and system environment information, and the user related information comprises an access service type and link information; when the network demand index is greater than or equal to 0 and less than or equal to a first threshold value, or greater than or equal to a second threshold value and less than or equal to 1, updating the current path based on the user related information and a path planning algorithm; and under the condition that the network demand index is greater than a first threshold value and less than a second threshold value, if a parameter difference value between the parameter of the access service type and the parameter of the current path is greater than a preset difference value, updating the current path based on user related information and a path planning algorithm, therefore, targeted path planning based on the user related information is realized, and the communication efficiency between the nodes is improved.

Description

Technical Field

[0001] The present invention relates to the field of network technology, and in particular to a path planning method, device and server. Background Art

[0002] In the Internet of Things, node path planning is an important process to ensure efficient communication, data transmission and stable network operation. In the modern network environment, users have diverse performance requirements for the security of access nodes and the types of access services required. In order to meet these different requirements, reasonable and effective node path planning is particularly important in multi-node networking systems.

[0003] However, traditional node path planning in the prior art only considers shortening the user access time and is unable to perform targeted path planning, which results in low communication efficiency between nodes. Summary of the invention

[0004] The present invention provides a path planning method, device and server, which are used to solve the problem in the prior art that traditional node path planning only considers shortening the user access time and cannot perform targeted path planning, thereby resulting in low communication efficiency between nodes.

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

[0006] Calculate the network demand index based on the acquired user-related information and system environment information, wherein the user-related information includes access service type and link information;

[0007] 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, updating the current path based on the user-related information and the path planning algorithm;

[0008] 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 parameters of the access service type and the parameters of the current path is greater than the preset difference, the current path is updated based on the user-related information and the path planning algorithm.

[0009] In a possible implementation, the calculating the network demand index based on the acquired user-related information and system environment information includes:

[0010] Determining a network index value corresponding to the access service type, and determining an abnormal event index value corresponding to the system environment information;

[0011] After calculating a first value obtained by multiplying the network index value by a current stability parameter, calculating a second value obtained by dividing the first value by a preset stability parameter;

[0012] Using the sum of the second value and the abnormal event index value as the network demand indicator;

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

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

[0015] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0016] Construct an adjacency matrix based on the normalized values ​​of each node;

[0017] 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.

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

[0019] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0020] Construct an adjacency matrix based on the normalized values ​​of each node;

[0021] Determining an optimized path from an initial node to a destination node based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm;

[0022] Taking the delay and minimum bandwidth required for accessing the service type as evaluation conditions, and determining the performance improvement value of the optimized path over the current path based on the evaluation conditions;

[0023] 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.

[0024] In a possible implementation manner, the current stability parameter is obtained through the following steps:

[0025] Assigning link information of each node based on a preset parameter comparison table;

[0026] Perform logarithmic transformation on the link information after each node is assigned, and obtain the standardized value corresponding to the link information of each node;

[0027] Calculate the normalized value corresponding to the link information of each node based on the preset interval using the normalized value;

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

[0029] In a second aspect, an embodiment of the present application provides a path planning device, the device comprising:

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

[0031] A path updating 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; 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 parameter of the access service type and the parameter of the current path is greater than a preset difference, then update the current path based on the user-related information and the path planning algorithm.

[0032] In a possible implementation manner, the information acquisition module is specifically used to:

[0033] Determining a network index value corresponding to the access service type, and determining an abnormal event index value corresponding to the system environment information;

[0034] After calculating a first value obtained by multiplying the network index value by a current stability parameter, calculating a second value obtained by dividing the first value by a preset stability parameter;

[0035] Using the sum of the second value and the abnormal event index value as the network demand indicator;

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

[0037] In a possible implementation manner, the path updating module is specifically used to:

[0038] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0039] Construct an adjacency matrix based on the normalized values ​​of each node;

[0040] 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.

[0041] In a possible implementation manner, the path updating module is specifically used to:

[0042] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0043] Construct an adjacency matrix based on the normalized values ​​of each node;

[0044] Determining an optimized path from an initial node to a destination node based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm;

[0045] Taking the delay and minimum bandwidth required for accessing the service type as evaluation conditions, and determining the performance improvement value of the optimized path over the current path based on the evaluation conditions;

[0046] 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.

[0047] In a third aspect, an embodiment of the present application provides a server, comprising a memory and a processor, wherein the memory stores a computer program running on the processor, and when the computer program is executed by the processor, a method as described in any one of the first aspects is implemented.

[0048] The beneficial effects of the present invention are as follows:

[0049] An embodiment of the present application provides a path planning method, device and server, the method comprising: calculating a network demand index based on acquired user-related information and system environment information, wherein the user-related information includes an access service type and link information; 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, 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 it is determined that the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, updating the current path based on the user-related information and the path planning algorithm, thereby achieving targeted path planning based on the user-related information, thereby improving the communication efficiency between nodes. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0051] Figure 1 A schematic diagram of a flow chart of a path planning method provided in an embodiment of the present application;

[0052] Figure 2 A flowchart of a method for calculating a network demand index provided in an embodiment of the present application;

[0053] Figure 3 A schematic diagram of a flow chart of a method for calculating a current stability parameter provided in an embodiment of the present application;

[0054] Figure 4 A flowchart of another path planning method provided in an embodiment of the present application;

[0055] Figure 5 A flowchart of another path planning method provided in an embodiment of the present application;

[0056] Figure 6 A schematic diagram of a path planning device provided in an embodiment of the present application;

[0057] Figure 7 A schematic diagram of the structure of a server provided in an embodiment of the present application. DETAILED DESCRIPTION

[0058] In order to make the purpose, technical scheme and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] It should be noted that the terms "including" and "having" and their variations involved in the documents of this application are intended to cover non-exclusive inclusions. 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 clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0060] The terms "first" and "second" in this document are used for descriptive purposes only and should not be understood as explicitly or implicitly indicating relative importance or implicitly indicating the number of technical features indicated. Therefore, features defined as "first" and "second" may explicitly or implicitly include one or more of the features, and in the description of the embodiments of this application, unless otherwise specified, "plurality" means two or more.

[0061] The word “exemplary” is used hereinafter to mean “serving as an example, example, or illustration.” Any embodiment described as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.

[0062] In the Internet of Things, node path planning is an important process to ensure efficient communication, data transmission and stable network operation. In the modern network environment, users have diverse performance requirements for the security of access nodes and the types of access services required. In order to meet these different requirements, reasonable and effective node path planning is particularly important in multi-node networking systems.

[0063] However, traditional node path planning in the prior art only considers shortening the user access time and is unable to perform targeted path planning, which results in low communication efficiency between nodes.

[0064] Based on the above problems, Figure 1 FIG. 1 is a flow chart of a path planning method provided in an embodiment of the present application, and the steps of the method are as follows:

[0065] S101, calculating 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;

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

[0067] 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, updating the current path based on user-related information and the path planning algorithm;

[0068] S103: 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 the path planning algorithm.

[0069] An embodiment of the present application provides a path planning method, which includes: calculating a network demand index based on acquired user-related information and system environment information, wherein the user-related information includes an access service type and link information; 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, 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 it is determined that the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, updating the current path based on the user-related information and the path planning algorithm, thereby achieving targeted path planning based on user-related information, thereby improving the communication efficiency between nodes.

[0070] In one possible approach, Figure 2 As shown, it is a flow chart of a method for calculating a network demand index provided in an embodiment of the present application, and the specific steps are as follows:

[0071] S201, determining a network index value Ls corresponding to an access service type, and determining an abnormal event index value Lc corresponding to system environment information;

[0072] S202, after calculating a first value obtained by multiplying the network index value Ls by the current stability parameter A1, calculate a second value obtained by dividing the first value by the preset stability parameter A2;

[0073] S203, taking the sum of the second value and the abnormal event index value Lc as the network demand index P;

[0074] 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.

[0075] That is, the calculation formula of the network demand index P is as follows:

[0076]

[0077] In a specific embodiment, the network index value Ls is a preset value corresponding to the access service type, and the abnormal event index value Lc is a historical access abnormal event index of the access service type, and the abnormal event includes link interruption and node loss of connection.

[0078] 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 0.1, the current stability parameter A1 is 2.5, and the preset stability parameter A2 is 8, the calculated network demand index is

[0079] In a possible implementation, Figure 3 FIG. 1 is a flow chart of a method for calculating a current stability parameter provided in an embodiment of the present application, which is obtained by the following steps:

[0080] S301, assigning link information of each node based on a preset parameter comparison table;

[0081] Specifically, for example, the link information of four nodes includes 10M bandwidth, 100M bandwidth, 100ms delay and 10ms delay. If the known preset parameter comparison table is to take the link information of 10M bandwidth as 0.1, the link information of 100M bandwidth as 0.01, the link information of 100ms delay as 0.1, and the link information of 10ms delay as 0.001, then the four link information after assignment are 0.1, 0.01, 0.1 and 0.001 respectively.

[0082] S302, performing logarithmic transformation on the link information after each node is assigned, to obtain a standardized value corresponding to the link information of each node;

[0083] Specifically, the four link information after the assignment are 0.1, 0.01, 0.1 and 0.001 respectively. Each link information is logarithmically transformed to obtain the standardized value corresponding to the link information of each node. If the preset logarithmic transformation is to take the logarithm with base 10, that is, the standardized value corresponding to the 10M bandwidth is log 10 (0.1) = -1, the standardized value corresponding to 100M bandwidth is log 10(0.01) = -2, the normalized value corresponding to the 100ms delay is log 10 (0.1) = -1, the normalized value corresponding to the 10ms delay is log 10 (0.001)=-3.

[0084] S303, calculating the normalized value corresponding to the link information of each node based on the preset interval;

[0085] Specifically, the obtained standardized values ​​are -1, -2, -1 and -3. If the preset interval is [0, 1], the normalized value is calculated based on the preset interval, wherein the calculation formula of the normalized value is as follows:

[0086] Normalized value=(normalized value−minimum value among normalized values) / (maximum value among normalized values−minimum value among normalized values).

[0087] From the obtained normalized values ​​of -1, -2, -1 and -3, we can know that the minimum value among the normalized values ​​is -3 and the maximum value among the normalized values ​​is -1. In other words, the normalized value corresponding to the 10M bandwidth is 1, the normalized value corresponding to the 100M bandwidth is 0.5, the normalized value corresponding to the 100ms delay is 1, and the normalized value corresponding to the 10ms delay is 0.

[0088] S304: Taking the sum of the normalized values ​​of each node as the current stable parameter.

[0089] Specifically, on the basis that the normalized values ​​of the four nodes are 1, 0.5, 1 and 0, the sum of the normalized values ​​of the four nodes is calculated to be 2.5, that is, the current stable parameter A1 is 2.5.

[0090] In a possible implementation, Figure 4 As shown, it is a flow chart of another path planning method provided in an embodiment of the present application. When the network demand index is greater than or equal to 0 and less than or equal to the first threshold, the current path is updated based on user-related information and the path planning algorithm. The steps are as follows:

[0091] S401, normalizing the link information of each node to obtain a standardized value corresponding to the link information of each node;

[0092] S402, constructing an adjacency matrix based on the standardized value of each node;

[0093] S403: 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.

[0094] It should be noted that when the network demand index 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 in 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.

[0095] Specifically, the path planning algorithm may be the Dijkstra algorithm.

[0096] For example, when the first threshold is 0.3, if the calculated network demand index P is 0.2, it indicates that the user's access service is in high performance demand. By standardizing the link information of each node, the standardized value corresponding to the link information of each node is obtained. Specifically, for example, the link information of four nodes is 10M bandwidth, 100M bandwidth, 100ms delay and 10ms delay. If the known preset parameter comparison table is to set the link information of 10M bandwidth to 0.1, the link information of 100M bandwidth to 0.2, the link information of 100ms delay to 0.1, and the link information of 10ms delay to 0.3, the four link information after assignment are 0.1, 0.2, 0.1 and 0.3 respectively. After constructing the adjacency matrix based on the four link information after assignment, the shortest path from the initial node to the destination node is determined based on the adjacency matrix and the Dijkstra algorithm, and the current path is updated based on the shortest path.

[0097] In a possible implementation, Figure 5 As shown, it is a flow chart of another path planning method provided in an embodiment of the present application. When the network demand index is greater than or equal to the 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:

[0098] S501, normalizing the link information of each node to obtain a standardized value corresponding to the link information of each node;

[0099] S502, constructing an adjacency matrix based on the standardized value of each node;

[0100] S503, determining an optimized path from the initial node to the destination node based on the adjacency matrix, the delay and minimum bandwidth required for accessing the service type, and the path planning algorithm;

[0101] S504, taking the delay and minimum bandwidth required for accessing the service type as evaluation conditions, and determining the performance improvement value of the optimized path and the current path based on the evaluation conditions;

[0102] S505: 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.

[0103] 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 in high stability demand. After periodically standardizing the link information of each node, the optimized path is determined based on the latency and minimum bandwidth required for the access service type and the path planning algorithm, and the current path is updated when the performance improvement value is greater than or equal to the preset performance threshold. The path planning algorithm may be the Dijkstra algorithm.

[0104] For example, when the second threshold is 0.,7, if the calculated network demand index P is 0.8, it indicates that the user's access service is in high stability demand. By standardizing the link information of each node, the standardized value corresponding to the link information of each node is obtained. Specifically, for example, the link information of four nodes is 10M bandwidth, 100M bandwidth, 100ms delay and 10ms delay. If the known preset parameter comparison table is to set the link information of 10M bandwidth to 0.1, the link information of 100M bandwidth to 0.2, the link information of 100ms delay to 0.1, and the link information of 10ms delay to 0.3, the four link information after assignment are 0.1, 0.2, 0.1 and 0.3 respectively. After constructing the adjacency matrix based on the four link information after assignment, the optimal path from the initial node to the destination node is determined based on the adjacency matrix, the delay and minimum bandwidth required for the access service type and the Dijkstra algorithm. The performance improvement value is compared with the preset performance threshold. When the performance improvement value is less than the preset performance threshold, it is determined that the performance improvement of the optimized path is small, that is, the current path is not updated. When the performance improvement value is greater than or equal to the preset performance threshold, it is determined that the performance improvement of the optimized path is large, and the current path is updated based on the optimized path.

[0105] In a possible implementation, when the network demand indicator is greater than a first threshold and less than a second threshold, if the parameter difference between the parameters of the access service type and the parameters 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.

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

[0107] Construct an adjacency matrix based on the normalized values ​​of each node;

[0108] 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.

[0109] 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 in high performance requirement or high stability requirement, and the parameter difference is determined based on the parameters of the access service type and the parameters of the current path, and the current path is updated based on the comparison result of the parameter difference and the preset difference.

[0110] For example, a certain type of application originally requires 10M bandwidth or ordinary firewall-level security protection, but the user needs to increase the security protection level or increase the bandwidth to 15M bandwidth for their own protection needs, that is, the parameter of the current path is 10M bandwidth, the parameter of the access service type is 15M bandwidth, and the calculated parameter difference is 5M. If the preset difference is 3M, that is, the parameter difference is greater than the preset difference, it is determined that the parameter difference has changed greatly, and the current path is updated based on user-related information and the Dijkstra algorithm; if the preset difference is 7M, that is, the parameter difference is less than the preset difference, it is determined that the parameter difference has not changed much, and in order to ensure the stability of the current path, the current path is not updated.

[0111] Based on the same technical concept, an embodiment of the present application also provides a path planning device. The principle of solving the problem by the path planning device is similar to that of the above-mentioned path planning method. 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 repeated.

[0112] like Figure 6 FIG. 1 is a schematic diagram of a path planning device provided in an embodiment of the present application, the device comprising:

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

[0114] The path update module 602 is used to update the current path based on 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 the first threshold, or greater than or equal to the 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 the preset difference, the current path is updated based on user-related information and the path planning algorithm.

[0115] The embodiments of the present application provide a path planning method and device, including: calculating a network demand index based on acquired user-related information and system environment information, wherein the user-related information includes an access service type and link information; 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, 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 it is determined that the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, updating the current path based on the user-related information and the path planning algorithm, thereby achieving targeted path planning based on the user-related information, thereby improving the communication efficiency between nodes.

[0116] In a possible implementation, the information acquisition module 601 is specifically used to:

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

[0118] After calculating a first value obtained by multiplying the network index value by the current stability parameter, calculating a second value obtained by dividing the first value by the preset stability parameter;

[0119] The sum of the second value and the abnormal event index value is used as a network demand indicator;

[0120] 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.

[0121] In a possible implementation, the path updating module 602 is specifically configured to:

[0122] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0123] Construct an adjacency matrix based on the normalized values ​​of each node;

[0124] 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.

[0125] In a possible implementation, the path updating module 602 is specifically configured to:

[0126] The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node;

[0127] Construct an adjacency matrix based on the normalized values ​​of each node;

[0128] Determine the optimal path from the initial node to the destination node based on the adjacency matrix, the latency and minimum bandwidth required to access the service type, and the path planning algorithm;

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

[0130] 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.

[0131] In a possible implementation, the path updating module 602 is specifically configured to:

[0132] Assigning link information of each node based on a preset parameter comparison table;

[0133] Perform logarithmic transformation on the link information after each node is assigned, and obtain the standardized value corresponding to the link information of each node;

[0134] Calculate the normalized value corresponding to the link information of each node based on the preset interval using the normalized value;

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

[0136] Based on the same technical concept, the embodiment of the present application also provides a server, the principle of solving the problem of the server is similar to that of the above-mentioned path planning method and device. Therefore, the implementation of the server can refer to the implementation of the animation playback method, and the repeated parts will not be repeated.

[0137] like Figure 7 As shown, it is a structural diagram of a server provided in an embodiment of the present application, including a memory 701 and a processor 702, and the memory 701 stores a computer program running on the processor 702. When the computer program is executed by the processor 702, the above-mentioned path planning method is implemented.

[0138] An embodiment of the present application provides a path planning method, device and server, the method comprising: calculating a network demand index based on acquired user-related information and system environment information, wherein the user-related information includes an access service type and link information; 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, 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 it is determined that the parameter difference between the parameter of the access service type and the parameter of the current path is greater than a preset difference, updating the current path based on the user-related information and the path planning algorithm, thereby achieving targeted path planning based on the user-related information, thereby improving the communication efficiency between nodes.

[0139] The present application is described above with reference to the block diagrams and / or flow charts showing the methods, devices (systems) and / or computer program products according to the embodiments of the present application. It should be understood that a block of the block diagram and / or flow chart diagram and a combination of blocks of the block diagram and / or flow chart diagram 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 device to produce a machine, so that the instructions executed by the computer processor and / or other programmable data processing device create a method for implementing the functions / actions specified in the block diagram and / or flow chart block.

[0140] Accordingly, the present application may also be implemented with 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, which has a computer-usable or computer-readable program code implemented in the medium, for use by an instruction execution system 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 may contain, store, communicate, transmit, or convey a program for use by an instruction execution system, device, or apparatus, or in conjunction with an instruction execution system, device, or apparatus.

[0141] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A path planning method, characterized in that: The method comprises: Calculate the network demand index based on the acquired user-related information and system environment information, 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, or greater than or equal to the second threshold and less than or equal to 1, 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 it is determined that the parameter difference between the parameters of the access service type and the parameters of the current path is greater than the preset difference, the current path is updated based on the user-related information and the path planning algorithm.

2. The method according to claim 1, characterized in that The network demand index is calculated based on the acquired user-related information and system environment information, including: Determining a network index value corresponding to the access service type, and determining an abnormal event index value corresponding to the system environment information; After calculating a first value obtained by multiplying the network index value by a current stability parameter, calculating a second value obtained by dividing the first value by a preset stability parameter; Using the sum of the second value and the abnormal event index value as the network demand indicator; The current stability parameter is the sum of the link information of each node after standardization and normalization, and the preset stability parameter is the preset value corresponding to the access service type.

3. The method according to claim 1, characterized in that When the network demand index is greater than or equal to 0 and less than or equal to the first threshold, updating the current path based on the user-related information and the path planning algorithm includes: The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; Construct an adjacency matrix based on the normalized values ​​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.

4. The method according to claim 1, characterized in that When the network demand index is greater than or equal to the second threshold and less than or equal to 1, updating the current path based on the user-related information and the path planning algorithm includes: The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; Construct an adjacency matrix based on the normalized values ​​of each node; Determining an optimized path from an initial node to a destination node based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm; Taking the delay and minimum bandwidth required for accessing the service type as evaluation conditions, and determining the performance improvement value of the optimized path over the current path 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.

5. The method according to claim 2, characterized in that The current stable parameters are obtained by the following steps: Assigning link information of each node based on a preset parameter comparison table; Perform logarithmic transformation on the link information after each node is assigned, and obtain the standardized value corresponding to the link information of each node; Calculate the normalized value corresponding to the link information of each node based on the preset interval using the normalized value; The sum of the normalized values ​​of each node is used as the current stable parameter.

6. A path planning device, characterized in that: The device comprises: An information acquisition module, used to calculate the network demand index based on the acquired user-related information and system environment information, wherein the user-related information includes access service type and link information; A path updating 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; 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 parameter of the access service type and the parameter of the current path is greater than a preset difference, then update the current path based on the user-related information and the path planning algorithm.

7. The device according to claim 6, characterized in that The information acquisition module is specifically used for: Determining a network index value corresponding to the access service type, and determining an abnormal event index value corresponding to the system environment information; After calculating a first value obtained by multiplying the network index value by a current stability parameter, calculating a second value obtained by dividing the first value by a preset stability parameter; Using the sum of the second value and the abnormal event index value as the network demand indicator; The current stability parameter is the sum of the link information of each node after standardization and normalization, and the preset stability parameter is the preset value corresponding to the access service type.

8. The device according to claim 6, characterized in that The path updating module is specifically used for: The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; Construct an adjacency matrix based on the normalized values ​​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.

9. The device according to claim 6, characterized in that The path updating module is specifically used for: The link information of each node is standardized to obtain a standardized value corresponding to the link information of each node; Construct an adjacency matrix based on the normalized values ​​of each node; Determining an optimized path from an initial node to a destination node based on the adjacency matrix, the latency and minimum bandwidth required for the access service type, and the path planning algorithm; Taking the delay and minimum bandwidth required for accessing the service type as evaluation conditions, and determining the performance improvement value of the optimized path over the current path 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.

10. A server, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program to be run on the processor, and when the computer program is executed by the processor, the method according to any one of claims 1 to 5 is implemented.

Images