WO2021147152A1

WO2021147152A1 - Route planning method and system, and central server

Info

Publication number: WO2021147152A1
Application number: PCT/CN2020/079352
Authority: WO
Inventors: 方君婷
Original assignee: 厦门网宿有限公司
Priority date: 2020-01-22
Filing date: 2020-03-13
Publication date: 2021-07-29
Also published as: CN111162954B; CN111162954A

Abstract

A route planning method and system, and a central server. The method comprises: generating, for a first location and a second location to be subjected to planning, a first coverage region matching the first location and a second coverage region between the first location and the second location (S1); selecting a first target POP node from the first coverage region and the second coverage region, and constructing, between the first location and the second location, candidate routes containing the first target POP node (S2); and acquiring route information of the candidate routes, comparing communication quality indicated in the route information against a calibrated communication quality threshold in a reference library to determine whether the candidate routes require correction, and taking the candidate route that does not require correction and the corrected candidate route as planned routes between the first location and the second location (S3). The solution can improve the efficiency of planning using a POP node.

Description

Path planning method, system and central server

cross reference

This application refers to the Chinese patent application No. 202010075430.5 entitled "A route planning method, system and central server" filed on January 22, 2020, which is fully incorporated into this application by reference

Technical field

This application relates to the field of Internet technology, in particular to a path planning method, system and central server.

Background technique

With the continuous development of Internet technology, most companies tend to seek a networking method that can be quickly deployed and flexibly adjusted. Especially as the number of cross-regional and cross-international companies increases, this demand is becoming stronger.

At present, SD-WAN (Software-Defined Wide Area Network, Software-Defined Wide Area Network) can provide enterprises with such network services. By using abundant POP nodes, they can establish a virtual private private line network covering the world. Specifically, the network Service providers provide POP nodes for enterprise users to access, and based on resource nodes, establish network dedicated lines between POP nodes used by enterprise users to provide network support for communication between branches of the same enterprise in different regions.

However, in order to meet the needs of various customers, network service providers will set up POP nodes across the country or even in various geographical areas around the world. However, due to the large number of POP nodes, how to quickly select from among the many POP nodes to achieve rapid networking while ensuring Communication quality has become a problem to be solved in the industry.

Summary of the invention

The purpose of this application is to provide a path planning method, system and central server, which can improve the planning efficiency of POP nodes.

In order to achieve the foregoing objective, one aspect of the present application provides a path planning method. The method includes: generating a first coverage area adapted to the first location for a first location and a second location to be planned, and Generate a second coverage area between the first location and the second location; select the first target POP node corresponding to the first location from the first coverage area and the second coverage area, and Construct at least one candidate path containing the first target POP node between the first location and the second location; obtain path information of the candidate path, and compare the quality under the path information with a reference library The calibrated quality threshold is compared to determine whether the candidate path needs to be corrected, and the candidate path that does not need to be corrected and the corrected candidate path are used as the difference between the first position and the second position. Planning path between.

In order to achieve the above objective, another aspect of the present application also provides a POP node planning system. The system includes: a coverage area generating unit configured to generate a coverage area corresponding to the first location and the second location to be planned. A first coverage area adapted to the location, and a second coverage area is generated between the first location and the second location; a candidate path construction unit is used to generate a second coverage area between the first coverage area and the second Select the first target POP node corresponding to the first location in the coverage area, and construct at least one candidate path including the first target POP node between the first location and the second location; the planned path is determined The unit is used to obtain the path information of the candidate path, and compare the quality under the path information with the quality threshold value calibrated under the reference library to determine whether the candidate path needs to be corrected, and to determine whether the candidate path needs to be corrected. The candidate path and the corrected candidate path are used as a planned path between the first position and the second position.

In order to achieve the foregoing objective, another aspect of the present application also provides a central server. The central server includes a processor and a memory. The memory is used to store a computer program. When the computer program is executed by the processor, the foregoing Path planning method.

It can be seen from the above that the technical solution provided by one or more embodiments of the present application can generate a first coverage area that is adapted to the first location for the first location and the second location to be planned, and in the first location and A second coverage area is generated between the second locations. Among the numerous POP nodes in the first coverage area and the second coverage area, a batch of POP nodes that are relatively close to the first location and the second location can be quickly screened out, and subsequently, the first target POP can be selected from these POP nodes node. Among them, the POP nodes delineated by the first coverage area can ensure that the distance to the access point is within a controllable range, and then based on the second coverage area, the pop nodes with a relatively fixed distance from the second location can be delineated to ensure that they are selected The POP node can take into account the distance between the point to be accessed and the dedicated line node. After the first target POP node is selected, a candidate path containing the first target POP node can be constructed between the first position and the second position, and the path information of the candidate path can be compared with the calibrated quality threshold under the reference library Make a comparison to determine whether the candidate path needs to be corrected. Finally, the candidate path that does not need to be corrected and the corrected candidate path are used as the final planned path to complete the path planning process. In this way, the first position and the second position can be guaranteed The quality of communication between. It can be seen that by planning multiple coverage areas, the technical solution provided by this application can filter out the first target POP node that is adapted from the numerous POP nodes in the coverage area, thereby improving the efficiency of POP node selection and path planning. , So as to achieve rapid enterprise networking. In addition, by introducing the quality threshold of the reference library, the candidate path is optimized, so that the communication quality between the first location and the second location can be guaranteed.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings that need to be used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative work.

Fig. 1 is a flowchart of a path planning method in an embodiment of the present application;

FIG. 2 is a schematic diagram of generating a coverage area in an embodiment of this application;

FIG. 3 is another schematic diagram of generating a coverage area in an embodiment of the present application;

Fig. 4 is a schematic diagram of functional modules of a path planning system in an embodiment of the present application;

Figure 5 is a schematic structural diagram of a central server in an embodiment of the present application.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present application clearer, the technical solutions of the present application will be described clearly and completely in conjunction with specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

This application provides a path planning method, which can be applied to a central server, and the central server can obtain node information of each POP node under SD-WAN. The node information may include, for example, the geographic location of the node, the computer room where the node is located, the available bandwidth of the node, the type of exit line, the network topology between the nodes, the network quality between the nodes, the cost between the nodes, the distribution density of the nodes, etc. In this way, the central server can select corresponding POP nodes for different customer needs according to the acquired node information, and then generate a planned path between the first location and the second location.

In the embodiment of this application, the first location and the second location are two location areas to be planned, which may correspond to the point to be accessed at the first location and the point to be accessed at the second location. For example, a company is in The Beijing branch and the Shanghai branch realize the communication between the nodes to be accessed in the two location areas through path planning.

Specifically, referring to FIG. 1, the path planning method provided by an embodiment of the present application is used to quickly plan an optional path between the first location and the second location, and may include the following multiple steps.

S1: For the first location and the second location to be planned, a first coverage area adapted to the first location is generated, and a second coverage area is generated between the first location and the second location .

In this embodiment, assuming that an enterprise needs to establish a connected local area network at the first location and the second location, the location information of the first location and the second location can be entered in the central server, where the location information may include specific Network address information, such as IP address, port number, and geographic location information, such as latitude and longitude information, or location tags corresponding to latitude and longitude information. At the same time, the network access type of the first location and the second location can also be entered in the central server. The network access type can include public network access and dedicated line access. Among them, public network access can refer to access to the Internet through the line provided by the operator, while dedicated line access can connect two places through physical optical fibers, and the two places where the dedicated line accesses are usually self-built lines, for example, SD-wan Dedicated line. In practical applications, if the network access type of the point to be accessed is the public network, it is usually necessary to select a POP node to access the dedicated line through the selected POP node.

In this embodiment, the network access type at the second location is set as dedicated line access, and the network access type at the first location is set as public network access. In this way, it is necessary to select a suitable POP node for the first location, so that the access point to be accessed at the first location is connected to the virtual private line through the selected POP node.

In order to quickly select a suitable POP node from a large number of POP nodes, the selection range of POP nodes can be initially reduced. Specifically, a first coverage area adapted to the first position may be generated, and a second coverage area may be generated between the first position and the second position. Wherein, referring to FIG. 2, when generating the first coverage area, the first position may be used as the center of the circle, and the specified distance may be used as the radius to make a circle, and the area covered by the circle may be used as the generated first coverage area. Wherein, the designated distance may be determined according to the linear distance between the first position and the second position.

Specifically, the central server can query the linear distance between the first position and the second position according to the position information of the first position and the second position, and then determine the appropriate radius coefficient, and multiply the linear distance and the radius coefficient. As the specified distance above.

Generally speaking, the radius coefficient is a value smaller than 1 and greater than 0, and the size of the radius coefficient is related to the distribution of POP nodes between the first position and the second position. If the POP nodes are densely distributed and the POP nodes are closer to the first position, the value of the radius coefficient can be smaller. And if the POP node distribution is relatively scattered, and the POP node is far from the first position, then the value of the radius coefficient can be larger. In practical applications, the radius coefficient can be started from a smaller value and continuously increased at a certain step. During each increase, the number of POP nodes contained in the circular area can be counted. Once the number of POP nodes contained in the circular area is greater than or equal to the first threshold, you can stop increasing the radius factor, and use the current radius factor as the final radius factor. The above-mentioned first threshold can be flexibly adjusted according to actual conditions. Through the above method, it can be ensured that the POP nodes contained in the circle made according to the specified distance meet the path planning requirements, and the optional POP nodes can be quickly confirmed.

In this embodiment, after the first coverage area is generated, a second coverage area may be generated between the first location and the second location. Specifically, a geometric figure can be planned between the first position and the second position. If the geometric figure satisfies a preset condition, the coverage area of the target geometric figure is regarded as the second coverage area; otherwise, the geometric figure is re-planned to meet the preset conditions. Set conditions, where the preset conditions include the geometric figure determining that the number of POP nodes included is greater than or equal to the second threshold; the selection of the geometric figure can also be set based on the distribution of POP nodes, usually preferential selection and POP node distribution More matching geometric figures ensure that more POP nodes can be quickly determined, and the hit rate of preset conditions can be improved. These geometric figures can be, for example, rectangles, sectors, rhombus-like figures, etc. shown in FIG. 2. Re-planning the geometric figure may include reselecting an adapted figure or adjusting the parameters of the original geometric figure. In some embodiments of the present application, the selected geometric figure takes the line between the first position and the second position as the axis of symmetry, and connects the first position and the second position.

S3: Select the first target POP node corresponding to the first location in the first coverage area and the second coverage area, and construct at least one link between the first location and the second location. The candidate path of the first target POP node.

In this embodiment, the first coverage area and the second coverage area may construct an intersection and a union. Among them, the POP nodes distributed in the intersection have a strong correlation with both the first position and the second position. Therefore, when selecting the first target POP node, the POP node in the intersection of the first coverage area and the second coverage area can be used as the first target POP node. The first location can access the dedicated line through the first target POP node.

The reason for preferentially selecting the POP node in the intersection as the first target POP node is that the POP node in the intersection is closer to the first position, so the link between the first position and the first target POP node is shorter. Reduce the probability of network failure, while taking into account the geographic relationship with the second location, avoiding the excessively long network line between the first target POP node and the second location, thereby ensuring the quality of the path.

In this embodiment, if the number of first target POP nodes selected in the intersection is less than the third threshold, the number of candidate paths generated based on the first target POP node does not meet the requirements. At this time, the first coverage area The area of the coverage area and the second coverage area is expanded to expand the range of intersection and obtain more first target POP nodes. If the number requirement is still not met, the union of the first coverage area and the second coverage area can be determined. Continue to select the first target POP node from among the unselected POP nodes, until the number of selected first target POP nodes reaches the third threshold. The third threshold can be flexibly adjusted according to actual business requirements.

It is worth noting that the method for determining the first threshold, the second threshold, and the third threshold may include: first determining the third threshold according to the number of requirements of the planned route, and then setting the first threshold and the second threshold based on a preset ratio, The preset ratio should be greater than 1. Correspondingly, in the process of expanding the intersection range, the preset ratio can be expanded, so as to ensure that the minimum value of the POP nodes included in the expanded first coverage area and the second coverage area increases.

In this embodiment, the number of first target POP nodes that are screened out according to the first coverage area and the second coverage area is often more than one. According to each first target POP node, it can be located between the first location and the second location. At least one candidate path is constructed in time. Further, the quality of these candidate paths can be evaluated to determine the final planned path.

In this embodiment, for any first target POP node, a candidate path including the first target POP node can be constructed between the first position and the second position. Specifically, the address information of the first location, the first target POP node, and the second location can be input into the traceroute tool or the mtr instruction to generate a path trace diagram between the first location and the second location, thereby generating a candidate path. In the path tracking graph, the IP address information of each node passing through from the first position to the second position, and communication quality parameters such as packet loss rate, delay, jitter, etc. corresponding to each node may be included.

For example, the first position is B, the second position is A, and the first target POP node is B0, then through the traceroute tool or the mtr command, you can construct A->B0->C->D->E->B like this One of the candidate paths. Since it is assumed that the second location A is dedicated line access, the connection between A->B0 is through a dedicated line, and the communication quality of this section of the line can usually be adjusted by optimizing the node network topology. The path in the B0->B segment of the public network can be optimized by combining operator information, whether it is a detour, whether it is cross-border, and other factors.

S5: Obtain the path information of the candidate path, and compare the quality of the path information with the quality threshold calibrated under the reference library to determine whether the candidate path needs to be corrected, and the candidate path and the correction The latter path is used as the planned path between the first position and the second position.

In this embodiment, after the candidate path is constructed, the path information of the candidate path can be obtained, and the path information can indicate the quality of the candidate path, including various information such as communication quality and communication cost. Specifically, communication quality can be measured by parameters such as delay, packet loss rate, jitter range, and remaining bandwidth. The communication cost can be measured by the construction cost of the computer room, the capital used by the equipment, the required bandwidth, and the network operator's fees.

In this embodiment, after obtaining the path information of the candidate path, the quality under the path information can be compared with the quality threshold value calibrated under the reference library, so as to determine whether the candidate path needs to be corrected. Among them, the reference library can be pre-loaded into the central server. The standard path information stored in the reference library may be the path quality between any two points estimated according to the theoretical prediction model. The theoretical prediction model can comprehensively calculate the theoretical path quality between the two points based on the geographic location of the two points, the type of network exit, the straight-line distance between the two points, and the cross-border information between the two points. That is, the quality threshold. If the quality of the candidate path is better than the quality threshold, no correction is needed, otherwise the candidate path needs to be corrected.

In this embodiment, if there is a calibrated quality threshold between the first position and the second position in the reference library, and the threshold has not expired, the calibrated quality threshold can be directly read. And if there is no corresponding calibrated quality threshold in the reference library or the threshold has expired, the location information of the first location and the second location, the network outlet type, the straight-line distance between the two points, and the The cross-border information and other parameters are input into the theoretical prediction model to calculate the corresponding calibrated quality threshold. By comparing the quality under the actual path information of the candidate path with the quality threshold value calibrated under the corresponding reference library, it can be determined whether the quality of the candidate path meets the expectation. For example, in the benchmark library, the quality threshold calibrated between points A and B indicates that the expected delay should not exceed 100ms, while the path information of the candidate path between points A and B obtained in the above manner indicates that, The actual time delay is 150ms, which shows that the quality of the candidate path does not meet expectations. If the quality of the candidate path does not meet expectations, then it is necessary to correct the candidate path, so that the corrected candidate path meets the expectations, so as to obtain a new planned path.

Specifically, when correcting the candidate route, optimization can be made from the perspective of whether it is cross-border and whether cross-operator has an impact on the line quality. For example, if the operator resource of the access port currently selected by the first target POP node does not match the operator resource at the first location, then there will be a cross-operator communication between the first target POP node and the first location. , This will inevitably lead to poor communication quality and cost increases. At this time, if there are other operator resources on the first target POP node, then the access port selected by the first target POP node can be adjusted so that the adjusted operator resources are the same as the operation used at the first location. Consistency of business resources.

And if there are no other operator resources on the first target POP node, you can find another POP node that is consistent with the operator resources used at the first location within the specified range of the first target POP node, and use the found The other POP node replaces the first target POP node. Among them, the designated range can be flexibly adjusted according to actual conditions. If the distribution density of nodes around the first target POP node is larger, then the specified range can be set to be slightly smaller, and if the distribution density of nodes around the first target POP node is smaller, then the specified range can be set to be slightly larger .

In addition, because two nodes often need to pass through more other nodes to achieve a communication connection, cross-border or detour problems may occur. For example, between B0 and B mentioned above, three nodes C, D, and E need to be passed, and the C, D, and E passed through may include other POP nodes or cross other areas. It can also be optimized for this situation. Specifically, in the candidate path, if the route path between the first target POP node and the first location includes other POP nodes, the candidate path can be determined and exited. The POP node closest to the first position replaces the first target POP node in the candidate path.

For example, in the candidate path A->B0->C->D->E->B, the target transport node E closest to location B can be determined, but the area to which E belongs is the same as the area served by B0 Different, then the POP node N (or E itself) can be found in the home area of E to replace B0, so that the candidate path A->N->B can be reconstructed. The purpose of this processing is to find a suitable POP node at a location close to B, so that there is no need to pass through other nodes between the POP node and B, thereby greatly improving the quality of network communication. In addition, since it is assumed that location A is dedicated line access, there can also be better network communication quality between A and N.

In this embodiment, if the path information of the candidate path meets the range defined by the quality threshold value calibrated under the reference library, there is no need to correct the candidate path. In this way, each selected first target POP node can be traversed in the above-mentioned manner, so that each candidate path can be judged, and finally the correction process can be completed. In this way, the candidate route without correction and the corrected route can be displayed as the final planned route to enterprise users for viewing. The displayed content can include not only the nodes that the planned route passes through, but also the theoretical communication parameters corresponding to the planned route, the theoretical bandwidth occupied, and the theoretical cost of constructing the planned route, so as to facilitate enterprise users to choose.

In practical applications, when the final planned route is presented to enterprise users, these planned routes can be sorted according to the route information of the planned route. For example, you can sort by time delay from low to high, and you can also sort by cost from low to high. Of course, it is also possible to perform weighted summation of various path information, and after obtaining the final sum parameter, sort according to the sum parameter, and the sort result can better reflect the comprehensive performance of the planned path. After sorting the planned paths, the sorting results can be displayed to enterprise users for the enterprise users to choose a suitable planning path.

It is worth noting that in the above embodiment, by evaluating candidate paths and correcting the lines that need to be corrected, a planned path that meets the benchmark requirements can be obtained for subsequent reference selection. It is understandable that the corrected path The candidate path may overlap with the candidate path that does not need to be corrected, so the step of de-duplication may be included before being presented to the user. For example, in some other embodiments, considering changes in the network status and unstable conditions of other factors, or in order to ensure the number of final planned paths, the original candidate paths before correction can also be included in the planned path category and presented together. .

It should be noted that the above scheme assumes that the network access type at the second location is dedicated line access. In practical applications, if the network access type at the second location is also public network access, a similar method can be used. , Select the corresponding second target POP node for the second location. Specifically, a third coverage area adapted to the second location may be generated, and a fourth coverage area may be generated between the second location and the first target POP node. Please participate in Figure 3. Assuming that the first target POP node has been selected for the first location, and the second location is connected to the virtual private line through the second target POP node, then for the second location of public network access, The second position is the center of the circle, a circle is made with the specified distance as the radius, and the area covered by the circle is regarded as the third coverage area. Among them, the designated distance can also be determined in a similar manner as described above. In addition, it is also possible to plan multiple geometric figures between the first position and the second position, select the corresponding target geometric figure, and use the coverage area of the selected target geometric figure as the fourth coverage area. Subsequently, a second target POP node can be selected in the third coverage area and the fourth coverage area, and a candidate path containing the second target POP node can be constructed between the second location and the first target POP node, so as to obtain the first target POP node. The candidate path between the position and the second position includes the first target POP node and the second target POP node, and the candidate path is optimized based on the above method.

It is worth noting that if the first location and the second location are both public network access, then the constructed candidate path will include the first location to the first target POP node segment, the first target POP node to the second target For the POP node segment and the second target POP node to the second location segment, when optimizing the candidate path, for example, each segment can be judged and corrected separately.

Please refer to FIG. 4, based on the same inventive concept, the present application also provides a path planning system, which includes:

A coverage area generating unit, configured to generate a first coverage area that is adapted to the first location for the first location and the second location to be planned, and is between the first location and the second location Generate a second coverage area;

Candidate path construction unit, configured to select a first target POP node corresponding to a first location in the first coverage area and the second coverage area, and between the first location and the second location Construct at least one candidate path including the first target POP node;

The planning path determination unit is used to obtain the path information of the candidate path, and compare the quality under the path information with the quality threshold value calibrated under the reference library to determine whether the candidate path needs to be corrected, and The candidate path that does not need to be corrected and the candidate path after correction are used as a planned path between the first position and the second position.

In an embodiment, the planned path determination unit includes: a target transmission node determination module, configured to determine if the route path between the first target POP node and the first location passes through the candidate path The area nearby contains other POP nodes, and the POP node closest to the first position is determined among the other POP nodes, and the first target POP node in the candidate path is replaced.

In one embodiment, the coverage area generating unit is further configured to generate a third coverage area adapted to the second location, and generate a third coverage area between the second location and the first target POP node. The fourth coverage area; the system also includes:

The second target POP node selection unit is configured to select a second target POP node in the third coverage area and the fourth coverage area, and construct between the second location and the first target POP node Including the candidate path of the second target POP node;

The determining unit is configured to obtain path information of the candidate path including the second target POP node, and determine whether the candidate path including the second target POP node needs to be corrected according to the obtained path information.

Referring to FIG. 5, the present application also provides a central server, the central server includes a memory and a processor, the memory is used to store a computer program, when the computer program is executed by the processor, the above path can be implemented Planning method.

In this application, the memory may include a physical device for storing information, which is usually digitized and then stored in a medium using electrical, magnetic, or optical methods. The memory may also include: a device that uses electrical energy to store information, such as RAM or ROM, etc.; a device that uses magnetic energy to store information, such as hard disk, floppy disk, magnetic tape, magnetic core memory, bubble memory, or U disk; using optical mode A device that stores information, such as a CD or DVD. Of course, there are other types of memory, such as quantum memory or graphene memory.

In this application, the processor can be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or a processor and a computer-readable medium storing computer-readable program codes (for example, software or firmware) executable by the (micro)processor, logic gates, switches, special-purpose integrated Circuit (Application Specific Integrated Circuit, ASIC), programmable logic controller and embedded microcontroller form, etc.

It can be seen from the above that the technical solution provided by one or more embodiments of the present application can generate a first coverage area that is adapted to the first location for the first location and the second location to be planned, and in the first location and A second coverage area is generated between the second locations. Among the many POP nodes in the first coverage area and the second coverage area, a batch of POP nodes that are relatively close to the first location and the second location can be screened out, and subsequently, the POP nodes that correspond to the first location can be selected from these POP nodes The first target POP node. Among them, the pop nodes delineated by the first coverage area can ensure the distance to the access point, and then based on the second coverage area, the pop nodes with a fixed distance from the dedicated line nodes can be delineated, so as to ensure that the selected pop nodes can take care of both The distance from the point to be accessed and the dedicated line node. After the first target POP node is selected, a candidate path containing the first target POP node can be constructed between the first position and the second position, and the path information of the candidate path can be evaluated to determine whether it is necessary to The candidate path is corrected. In this way, the communication quality between the first location and the second location can be guaranteed. Subsequently, the candidate path or the corrected path can be used as the final planned path, so as to quickly complete the POP node planning process. It can be seen that by planning multiple coverage areas, the technical solution provided by this application can quickly filter out the first target POP node that is adapted from the numerous POP nodes in the coverage area for the access of public network users, thereby improving Planning efficiency of POP nodes. In addition, by evaluating candidate paths, the communication quality between the first location and the second location can be ensured.

The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the difference from other embodiments. In particular, for the embodiments of the system and the central server, both can be explained with reference to the introduction of the foregoing method embodiments.

Those skilled in the art should understand that the embodiments of the present application can be provided as methods, systems, or computer program products. Therefore, this application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

This application is described with reference to flowcharts and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of this application. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing equipment to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing equipment are generated It is a device that realizes the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing equipment, so that a series of operation steps are executed on the computer or other programmable equipment to produce computer-implemented processing, so as to execute on the computer or other programmable equipment. The instructions provide steps for implementing the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

In a typical configuration, the computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include non-permanent memory in computer readable media, random access memory (RAM) and/or non-volatile memory, such as read-only memory (ROM) or flash memory (flash RAM). Memory is an example of computer readable media.

Computer-readable media include permanent and non-permanent, removable and non-removable media, and information storage can be realized by any method or technology. The information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical storage, Magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices. According to the definition in this article, computer-readable media does not include transitory media, such as modulated data signals and carrier waves.

It should also be noted that the terms "include", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or equipment including a series of elements not only includes those elements, but also includes Other elements that are not explicitly listed, or also include elements inherent to such processes, methods, commodities, or equipment. If there are no more restrictions, the element defined by the sentence "including a..." does not exclude the existence of other identical elements in the process, method, commodity, or equipment that includes the element.

The above descriptions are only examples of the present application, and are not used to limit the present application. For those skilled in the art, this application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included in the scope of the claims of this application.

Claims

A path planning method, including:

For the first location and the second location to be planned, generate a first coverage area adapted to the first location, and generate a second coverage area between the first location and the second location;

Select the first target POP node corresponding to the first location in the first coverage area and the second coverage area, and construct at least one entry between the first location and the second location that contains the The candidate path of the first target POP node;

Obtain the path information of the candidate path, and compare the quality under the path information with the calibrated quality threshold under the reference library to determine whether the candidate path needs to be corrected, and the candidate path that does not need to be corrected And the corrected candidate path is used as a planned path between the first position and the second position.
The method according to claim 1, wherein generating a first coverage area adapted to the first location comprises:

Take the first position as the center and a designated distance as the radius to make a circle, and use the area covered by the circle as the first coverage area; wherein the designated distance is based on the first position and the The linear distance between the second positions is determined.
The method according to claim 2, wherein the designated distance is determined in the following manner:

Obtain the linear distance between the first position and the second position, determine a radius coefficient, and use the product of the linear distance and the radius coefficient as the designated distance; wherein, the calculation is performed according to the designated distance The number of POP nodes contained in the circle is greater than or equal to the first threshold.
The method of claim 1, wherein generating a second coverage area between the first location and the second location comprises:

A geometric figure is planned between the first position and the second position, and if the geometric figure meets a preset condition, the coverage area of the target geometric figure is taken as the second coverage area; otherwise, re-planning The geometric figure satisfies the preset condition, where the preset condition includes that the number of POP nodes determined to be included in the geometric figure is greater than or equal to a second threshold.
The method of claim 1, wherein selecting a first target POP node in the first coverage area and the second coverage area comprises:

Determine the intersection of the first coverage area and the second coverage area, and select a first target POP node in the intersection;

If the number of first target POP nodes selected in the intersection is less than the third threshold, determine the union of the first coverage area and the second coverage area, and unselected POP nodes in the union Continue to select the first target POP node.
The method according to claim 1, wherein correcting the candidate path comprises:

If the operator resources currently used by the first target POP node do not match the operator resources at the first location, the operator resources used by the first target POP node are adjusted so that the adjusted operation The quotient resources are consistent with the operator resources used at the first location, or find another POP node within the specified range of the first target POP node that is consistent with the operator resources used at the first location, And replace the first target POP node with the other POP node.
The method according to claim 1, wherein correcting the candidate path comprises:

In the candidate path, if the area covered by the routing path between the first target POP node and the first location includes other POP nodes, the first target POP node is determined and out of the other POP nodes. The POP node with the closest position replaces the first target POP node in the candidate path.
The method according to claim 1, wherein the method further comprises:

Sort the planned paths according to the path information, and display the sorting results.
The method according to claim 1, wherein the method further comprises:

Generating a third coverage area adapted to the second location, and generating a fourth coverage area between the second location and the first target POP node;

Selecting a second target POP node corresponding to the second location in the third coverage area and the fourth coverage area;

The candidate path between the first position and the second position further includes the second target POP node.
A path planning system, wherein the system includes:

A coverage area generating unit, configured to generate a first coverage area that is adapted to the first location for the first location and the second location to be planned, and is between the first location and the second location Generate a second coverage area;

The candidate path construction unit is configured to select the first target POP node corresponding to the first location in the first coverage area and the second coverage area, and to select the first target POP node between the first location and the second location Construct at least one candidate path including the first target POP node;

The planning path determination unit is used to obtain the path information of the candidate path, and compare the quality under the path information with the quality threshold value calibrated under the reference library to determine whether the candidate path needs to be corrected, and The candidate path that does not need to be corrected and the candidate path after correction are used as a planned path between the first position and the second position.
The system according to claim 10, wherein the planned path determination unit comprises:

The target transmission node determination module is configured to determine in the candidate path, if the area covered by the route path between the first target POP node and the first location includes other POP nodes, determine among the other POP nodes The POP node closest to the first position is selected, and the first target POP node in the candidate path is replaced.
The system according to claim 10, wherein the coverage area generating unit is further configured to generate a third coverage area that is adapted to the second position, and set between the second position and the first target A fourth coverage area is generated between POP nodes;

The system also includes:

The second target POP node selection unit is configured to select a second target POP node corresponding to a second location in the third coverage area and the fourth coverage area, and to select a second target POP node corresponding to the second location in the third coverage area and the fourth coverage area. A candidate path including the second target POP node is constructed between target POP nodes.
A central server, wherein the central server includes a memory and a processor, and the memory is used to store a computer program, and when the computer program is executed by the processor, the computer program can implement any one of claims 1 to 9 Methods.