CN111162954B - Path planning method, system and central server - Google Patents
Path planning method, system and central server Download PDFInfo
- Publication number
- CN111162954B CN111162954B CN202010075430.5A CN202010075430A CN111162954B CN 111162954 B CN111162954 B CN 111162954B CN 202010075430 A CN202010075430 A CN 202010075430A CN 111162954 B CN111162954 B CN 111162954B
- Authority
- CN
- China
- Prior art keywords
- coverage area
- location
- path
- target
- pop node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
Abstract
The invention discloses a path planning method, a system and a central server, wherein the method comprises the following steps: generating a first coverage area adapted to a first position and a second position to be planned, and generating a second coverage area between the first position and the second position; selecting a first target POP node in the first coverage area and the second coverage area, and constructing a candidate path containing the first target POP node between the first position and the second position; and acquiring path information of the candidate path, comparing the communication quality under the path information with a communication quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as a planned path between the first position and the second position. The technical scheme provided by the application can improve the planning efficiency of the POP node.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a path planning method, a path planning system and a central server.
Background
With the continuous development of internet technology, most enterprises tend to seek a networking mode which can be deployed quickly and adjusted flexibly, and particularly, the demand is more and more intense due to the increase of enterprises across regions and countries.
Currently, SD-WAN (Software-Defined Wide Area Network) can provide such Network services for enterprises, and establish a globally covered virtual private Network for the enterprises by using abundant POP nodes, specifically, a Network service provider provides POP nodes for enterprise users to access, and establishes a private Network line between POP nodes used by enterprise users based on resource nodes, so as to provide Network support for communication between branch offices of the same enterprise distributed in different regions.
However, in order to meet the needs of various clients, network service providers set POP nodes in the whole country or even in various geographic areas around the world, but because of the numerous POP nodes, how to quickly select from the numerous POP nodes, so as to realize quick networking, and meanwhile, ensuring the communication quality becomes a problem to be solved in the industry.
Disclosure of Invention
The application aims to provide a path planning method, a system and a central server, which can improve the planning efficiency of POP nodes.
In order to achieve the above object, an aspect of the present application provides a path planning method, where the method includes: generating a first coverage area adapted to a first position and a second position to be planned, and generating a second coverage area between the first position and the second position; selecting a first target POP node corresponding to the first position in the first coverage area and the second coverage area, and constructing at least one candidate path containing the first target POP node between the first position and the second position; and acquiring path information of the candidate path, comparing the quality under the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as a planned path between the first position and the second position.
In order to achieve the above object, another aspect of the present application further provides a system for planning a POP node, where the system includes: a coverage area generating unit, configured to generate, for a first location and a second location to be planned, a first coverage area adapted to the first location, and generate a second coverage area between the first location and the second location; a candidate path construction unit, configured to select a first target POP node corresponding to the first location in the first coverage area and the second coverage area, and construct at least one candidate path including the first target POP node between the first location and the second location; and the planned path determining unit is used for acquiring the path information of the candidate path, comparing the quality under the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as the planned path between the first position and the second position.
In order to achieve the above object, another aspect of the present application further provides a central server, which includes a processor and a memory, where the memory is used to store a computer program, and the computer program, when executed by the processor, implements the above path planning method.
As can be seen from the above, in the technical solutions provided in one or more embodiments of the present application, for a first location and a second location to be planned, a first coverage area adapted to the first location may be generated, and a second coverage area may be generated between the first location and the second location. A plurality of POP nodes which are relatively close to the first position and the second position can be quickly screened out from a plurality of POP nodes in the first coverage area and the second coverage area, and then a first target POP node can be selected from the POP nodes. The POP nodes defined by the first coverage area can ensure that the distance between the POP nodes and the to-be-accessed point is within a controllable range, and then the POP nodes with the fixed distance from the second position can be defined based on the second coverage area, so that the distance between the selected POP nodes and the to-be-accessed point and the private line node can be considered. 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, path information of the candidate path can be compared with a calibration quality threshold value in a reference library, whether the candidate path needs to be corrected or not is judged, and finally the candidate path which does not need to be corrected and the corrected candidate path are taken as a final planned path, so that a path planning process is completed, and therefore communication quality between the first position and the second position can be guaranteed. Therefore, according to the technical scheme provided by the application, the adaptive first target POP node can be screened from the numerous POP nodes in the coverage area by planning the plurality of coverage areas, so that the selection efficiency of the POP nodes and the path planning efficiency are improved, and the rapid networking of enterprises is realized. In addition, the candidate paths are optimized by introducing the quality threshold of the reference library, so that the communication quality between the first position and the second position can be ensured.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a path planning method in an embodiment of the invention;
FIG. 2 is a schematic diagram of the generation of coverage areas in an embodiment of the present invention;
FIG. 3 is another schematic representation of the generation of coverage areas in an embodiment of the present invention;
FIG. 4 is a functional block diagram of a routing system in an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a central server in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clear, the technical solutions of the present application will be clearly and completely described below with reference to the detailed description of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some embodiments of the present application, and not all embodiments. All other embodiments obtained by a person of ordinary skill in the art without any inventive work based on the embodiments in the present application are within the scope of protection of the present application.
The application provides a path planning method which can be applied to a central server, and the central server can acquire node information of each POP node under an SD-WAN. The node information may include, for example, a geographical location of the node, a machine room in which the node is located, a usable bandwidth of the node, an egress line type, a network topology between the nodes, a network quality between the nodes, a cost between the nodes, a distribution density of the nodes, and the like. Therefore, the central server can select corresponding POP nodes for different customer requirements according to the acquired node information, and further generate a planning path between the first position and the second position.
In the embodiment of the present invention, the first location and the second location are two location areas to be planned, and may correspond to an access point to be accessed at the first location and an access point to be accessed at the second location, for example, an affiliate of a certain enterprise in beijing and an affiliate in shanghai, and communication between nodes to be accessed in the two location areas is realized through planning of a path.
Specifically, referring to fig. 1, a path planning method provided in an embodiment of the present application is used for rapidly planning a selectable path between a first location and a second location, and may include the following steps.
S1: for a first location and a 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 a first location and a second location, location information of the first location and the second location may be entered in the central server, where the location information may include specific network address information, such as an IP address and a port number, and geographic location information, such as latitude and longitude information, or a location tag corresponding to the latitude and longitude information. At the same time, the network access types of the first location and the second location may also be entered in the central server. The network access types may include public network access and private line access. The public network access can refer to accessing the internet through a line provided by an operator, the two places can be connected through physical optical fibers, and the two places of the private network access are usually self-established lines, such as an SD-wan private line. In practical application, the network access type of the point to be accessed is public network, and a POP node is usually selected, so that a private line is accessed through the selected POP node.
In this embodiment, the network access type of the second location is set as private access, and the network access type of the first location is set as public access. Therefore, an adaptive POP node needs to be selected for the first location, so that the to-be-accessed point at the first location is accessed to the virtual private line through the selected POP node.
In order to quickly select a proper POP node from a plurality of POP nodes, the selection range of the POP nodes can be preliminarily reduced. In particular, a first coverage area may be generated that is adapted to a first location, and a second coverage area may be generated between the first location and a second location. Referring to fig. 2, when generating the first coverage area, a circle may be made with the first position as a center of the circle and the specified distance as a radius, and an area covered by the circle may be used as the generated first coverage area. Wherein the specified distance may be determined based on a linear distance between the first location and the second location.
Specifically, the central server may query a straight-line distance between the first location and the second location according to the location information of the first location and the second location, then determine an appropriate radius coefficient, and take the product of the straight-line distance and the radius coefficient as the above-mentioned specified distance.
Generally, the radius coefficient is a value smaller than 1 and larger than 0, and the magnitude of the radius coefficient is related to the distribution of POP nodes between the first location and the second location. If the distribution of the POP nodes is dense and the POP nodes are closer to the first position, the value of the radius coefficient can be smaller. And if the distribution of the POP nodes is dispersed and the POP nodes are far away from the first position, the value of the radius coefficient can be larger. In practical application, the radius coefficient can be increased continuously from a smaller value according to a certain step, and the number of POP nodes contained in the circular area can be counted in each increasing process. Once the number of POP nodes contained in the circular area is greater than or equal to the first threshold, the increase of the radius coefficient may be stopped, and the current radius coefficient may be taken as the finally determined radius coefficient. The first threshold value can be flexibly adjusted according to actual conditions. Through the mode, the POP nodes contained in the circle made according to the specified distance can be ensured to meet the path planning requirement, and the optional POP nodes can be quickly and accurately identified.
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 may be planned between the first position and the second position, and if the geometric figure satisfies a preset condition, the coverage area of the target geometric figure is taken as a second coverage area; if not, replanning the geometric figure until a preset condition is met, wherein the preset condition comprises that the number of POP nodes determined to be contained in the geometric figure is greater than or equal to a second threshold value; the selection of the geometric figure can also be set based on the distribution condition of the POP nodes, and the geometric figure which is matched with the distribution condition of the POP nodes is selected preferentially to ensure that more POP nodes are determined quickly and the hit rate of the preset condition is improved. These geometries may be, for example, rectangles, sectors, rhomboid-like shapes, etc., as shown in fig. 2. Replanning the geometry may include reselecting the adapted geometry or adjusting parameters of the original geometry. In some embodiments of the invention, the selected geometry has a line between the first location and the second location as an axis of symmetry and connects the first location and the second location.
S3: and selecting a first target POP node corresponding to the first position in the first coverage area and the second coverage area, and constructing at least one candidate path containing the first target POP node between the first position and the second position.
In this embodiment, an intersection and a union may be constructed for the first coverage area and the second coverage area. And the POP nodes distributed in the intersection have stronger association with the first position and the second position. Thus, POP nodes within the intersection of the first coverage area and the second coverage area may be considered first target POP nodes when selecting the first target POP node. The first location may access the private line through a first target POP node.
The reason why the POP nodes in the intersection are preferentially taken as the first target POP node is that the POP nodes in the intersection are closer to the first position, so that the link between the first position and the first target POP node is shorter, the occurrence probability of network faults is reduced, the geographical relation with the second position is considered, the overlong network line between the first target POP node and the second position is avoided, and the path quality is ensured.
In this embodiment, if the number of the first target POP nodes selected in the intersection is smaller than the third threshold, the number of the candidate paths generated based on the first target POP nodes does not meet the requirement, at this time, the areas of the first coverage area and the second coverage area may be enlarged, so as to expand the range of the intersection and obtain more first target POP nodes, if the number requirement cannot be met, the union of the first coverage area and the second coverage area may be determined, and the first target POP nodes continue to be selected from the unselected POP nodes in the union until the number of the first target POP nodes selected reaches the third threshold. The third threshold value can be flexibly adjusted according to actual service requirements.
It should be noted that the determining method of the first threshold, the second threshold and the third threshold may include determining the third threshold according to the required number of the planned paths, and then setting the first threshold and the second threshold based on a preset ratio, where the preset ratio is greater than 1. Correspondingly, in the process of expanding the intersection range, the preset proportion can be expanded, so that the lowest value of the POP nodes contained in the expanded first coverage area and the second coverage area is increased.
In this embodiment, the number of the first target POP nodes screened out according to the first coverage area and the second coverage area is often more than one, and at least one candidate route can be constructed between the first position and the second position according to each first target POP node. Further, quality evaluation can be performed on the candidate paths, so as to determine a final planned path.
In this embodiment, for any first target POP node, a candidate path including the first target POP node may be constructed between the first location and the second location. Specifically, address information of the first location, the first target POP node, and the second location may be input to a traceroute tool or an mtr instruction, thereby generating a path trace map between the first location and the second location, thereby generating a candidate path. The path tracking graph may include IP address information of each node passing from the first location to the second location, and communication quality parameters such as packet loss rate, delay, jitter, and the like corresponding to each node.
For example, if the first location is B, the second location is a, and the first target POP node is B0, then one of the candidate paths a- > B0- > C- > D- > E- > B can be constructed by a traceroute tool or an mtr instruction. Since the second location a is assumed to be a dedicated access, a- > B0 are connected by a dedicated line, and the communication quality of this section of line can be generally adjusted by optimizing the topology of the node network. The path in the public network of B0- > B can be optimized by combining with the operator information and factors such as whether to detour or cross border.
S5: and acquiring path information of the candidate path, comparing the quality of the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path and the corrected path as a planned path between the first position and the second position.
In this embodiment, after the candidate path is constructed, path information of the candidate path may be obtained, where the path information may indicate quality of the candidate path, including information of communication quality, communication cost, and the like. Specifically, the communication quality may be measured by parameters such as time delay, packet loss rate, jitter range, and remaining bandwidth. The communication cost can be measured by the construction cost of the machine room, the capital used by the equipment, the required bandwidth, the expense of the network operator and the like.
In the present embodiment, after the path information of the candidate path is acquired, the quality of the path information may be compared with the quality threshold value specified under the reference library to determine whether or not the candidate path needs to be corrected. Wherein the reference library may 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 a theoretical estimation model. The theoretical prediction model can comprehensively measure and calculate the path quality theoretically possessed between two points, namely a quality threshold value, according to the geographic positions of the two points, the network exit type, the linear distance between the two points, the cross-border information between the two points and other parameters, and if the quality of the candidate path is superior to the quality threshold value, correction is not needed, otherwise, the candidate path needs to be corrected.
In this embodiment, if the calibrated quality threshold between the first location and the second location is available in the reference library and the threshold has not expired, the calibrated quality threshold may be read directly. If the corresponding calibrated quality threshold value does not exist in the reference library or the threshold value is expired, parameters such as position information of the first position and the second position, a network exit type, a linear distance between two points, cross-border information between the two points and the like can be input into the theoretical prediction model, and the corresponding calibrated quality threshold value is calculated. The quality of the candidate path under the actual path information is compared with the quality threshold value calibrated under the corresponding reference library, so that whether the quality of the candidate path reaches the expectation or not can be determined. For example, in the reference library, the calibrated quality threshold between points a and B indicates that the expected delay should not exceed 100ms, whereas the path information of the candidate path between points a and B obtained in the above manner indicates that the actual delay is 150ms, which indicates that the quality of the candidate path does not reach the expected quality. If the quality of the candidate path does not reach the expectation, the candidate path needs to be corrected, so that the corrected candidate path reaches the expectation, and a new planning path is obtained.
Specifically, when the candidate route is corrected, optimization can be performed from the viewpoint of whether the influence on the route quality is cross border or not, and whether the influence on the route quality is cross operator or not. For example, if the operator resource of the currently selected access port of the first target POP node does not match the operator resource at the first location, cross-operator communication between the first target POP node and the first location may occur, which may result in poor communication quality and cost increase. At this time, if the first target POP node further has other operator resources, the selected access port of the first target POP node may be adjusted, so that the adjusted operator resources are consistent with the operator resources adopted at the first location.
And if no other operator resources exist on the first target POP node, searching for another POP node which is consistent with the operator resources adopted at the first position in the specified range of the first target POP node, and replacing the first target POP node with the searched another POP node. Wherein, the appointed range can be flexibly adjusted according to the actual situation. The specified range may be set slightly smaller if the distribution density of the nodes around the first target POP node is large, and slightly larger if the distribution density of the nodes around the first target POP node is small.
In addition, cross-border or detour problems may occur because two nodes often need to pass through more other nodes to realize communication connection. For example, between B0 and B, it is necessary to pass through C, D, E three nodes, and C, D, E that passes through may include other POP nodes or span other areas. In this case, the optimization may be performed, and specifically, in the candidate path, if the area through which the routing path between the first destination POP node and the first location passes includes other POP nodes, the first destination POP node in the candidate path may be replaced at the determined POP node closest to the first location.
For example, in candidate path a- > B0- > C- > D- > E- > B, the target transfer node E closest to location B may be determined, however the area to which E belongs is different from the area served by B0, and then POP node N (and possibly E itself as well) may be found within the home area of E to replace B0, so that candidate path a- > N- > B may be reconstructed. The purpose of this is to find a suitable POP node at a position close to B, and then between the POP node and B, there is no need to pass through other nodes, thereby greatly improving the network communication quality. In addition, since the location a is assumed to be dedicated access, the network communication quality between a and N may be better.
In this embodiment, if the path information of the candidate path meets the range defined by the quality threshold calibrated under the reference library, the candidate path does not need to be corrected. In this way, each selected first target POP node can be traversed according to the above manner, so that each candidate path is judged, and finally, the correction process can be completed. Therefore, the corrected candidate path and the corrected path are not needed, and the final planned path can be displayed to an enterprise user for viewing. The displayed content can comprise each node passed by the planned path, and also can comprise theoretical communication parameters corresponding to the planned path, occupied theoretical bandwidth and theoretical cost for building the planned path, so that enterprise users can conveniently select the nodes.
In practical applications, when the final planned path is presented to the enterprise user, the planned paths may be sorted according to the path information of the planned paths. For example, the ordering may be from low to high latency, and may also be from low to high cost. Of course, after the various path information is subjected to weighted summation and the final summation parameter is obtained, the path information is sorted according to the summation parameter, and the sorting result can better reflect the comprehensive performance of the planned path. After the planned paths are sorted, the sorting result can be displayed to the enterprise user, so that the enterprise user can select a proper planned path.
It should be noted that in the above embodiments, by evaluating the candidate paths and correcting the lines that need to be corrected, the planned paths that meet the benchmark requirements can be obtained for the subsequent reference selection, and it can be understood that the corrected candidate paths may be repeated with the candidate paths that do not need to be corrected, and then a deduplication step may be included before presenting to the user. Furthermore, in some other embodiments, in consideration of the situation that the network state changes and other factors are unstable, or in order to ensure the number of the final planned paths, the original candidate paths before correction may also be included in the category of the planned paths and presented together.
It should be noted that, in the above-mentioned solution, it is assumed that the network access type of the second location is private access, and in practical application, if the network access type of the second location is also public network access, a corresponding second target POP node may be selected for the second location in a similar manner. In particular, a third coverage area may be generated that is compatible with the second location, and a fourth coverage area may be generated between the second location and the first target POP node. Referring to fig. 3, assuming that a first target POP node has been selected for a first location and a second location is connected to a virtual private line through a second target POP node, a circle is made for the second location of the public network access with the second location as a center of the circle and a specified distance as a radius, and an area covered by the circle is used as a third coverage area. Wherein the specified distance may also be determined in a similar manner as described above. Furthermore, it is also possible to plan a plurality of geometries between the first and second locations and to select a corresponding target geometry and to use the coverage area of the selected target geometry as the fourth coverage area. Subsequently, a second target POP node may be selected in the third coverage area and the fourth coverage area, and a candidate path including the second target POP node is constructed between the second location and the first target POP node, so as to obtain a candidate path including the first target POP node and the second target POP node between the first location and the second location, and the candidate path is optimized based on the above manner.
It should be noted that if the first location and the second location are both public network access, the constructed candidate path will include a section from the first location to the first destination POP node, a section from the first destination POP node to the second destination POP node, and a section from the second destination POP node to the second location, and thus, when optimizing the candidate path, it is preferable that each section can be respectively judged and corrected.
Referring to fig. 4, based on the same inventive concept, the present application further provides a path planning system, including:
a coverage area generating unit, configured to generate, for a first location and a second location to be planned, a first coverage area adapted to the first location, and generate a second coverage area between the first location and the second location;
a 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 construct at least one candidate path including the first target POP node between the first location and the second location;
and the planned path determining unit is used for acquiring the path information of the candidate path, comparing the quality under the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as the planned path between the first position and the second position.
In one embodiment, the planned path determination unit includes:
and the target transmission node determining module is used for determining a POP node closest to the first position from the other POP nodes to replace the first target POP node in the candidate path if the other POP nodes are included in the vicinity of the passing area of the routing path between the first target POP node and the first position.
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 fourth coverage area between the second location and the first target POP node;
the system further comprises:
a second target POP node selecting unit configured to select a second target POP node in the third coverage area and the fourth coverage area, and construct a candidate path including the second target POP node between the second location and the first target POP node;
and the judging unit is used for acquiring the path information of the candidate path containing the second target POP node and judging whether the candidate path containing the second target POP node needs to be corrected or not according to the acquired path information.
Referring to fig. 5, the present application further provides a central server, where the central server includes a memory and a processor, the memory is used to store a computer program, and the computer program, when executed by the processor, can implement the above-mentioned path planning method.
In this application, the memory may include physical means for storing information, typically media that digitize the information and store it in an electrical, magnetic, or optical manner. The memory may in turn comprise: devices that store information using electrical energy, such as RAM or ROM; devices that store information using magnetic energy, such as hard disks, floppy disks, tapes, core memories, bubble memories, or usb disks; devices for storing information optically, such as CDs or DVDs. Of course, there are other ways of memory, such as quantum memory or graphene memory, among others.
In the present application, the processor may be implemented in any suitable way. For example, the processor may take the form of, for example, a microprocessor or processor and a computer-readable medium that stores computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, an embedded microcontroller, and so forth.
As can be seen from the above, in the technical solutions provided in one or more embodiments of the present application, for a first location and a second location to be planned, a first coverage area adapted to the first location may be generated, and a second coverage area may be generated between the first location and the second location. A plurality of POP nodes that are relatively close to the first location and the second location may be screened out from the plurality of POP nodes in the first coverage area and the second coverage area, and subsequently, a first target POP node corresponding to the first location may be selected from the POP nodes. The pop node defined by the first coverage area can guarantee the distance between the pop node and the access point to be accessed, and then the pop node with the fixed distance between the pop node and the private line node can be defined based on the second coverage area, so that the selected pop node can be guaranteed to be compatible with the distance between the access point to be accessed and the private line node. After the first target POP node is selected, a candidate path including the first target POP node may be constructed between the first location and the second location, and path information of the candidate path may be evaluated, thereby determining whether the candidate path needs to be corrected. In this way, the quality of communication between the first location and the second location can be guaranteed. Subsequently, the candidate path or the corrected path can be used as a final planning path, so that the process of planning the POP node is completed quickly. Therefore, according to the technical scheme provided by the application, the adaptive first target POP node can be quickly screened out from numerous POP nodes in the coverage area for the access of the public network users by planning a plurality of coverage areas, so that the planning efficiency of the POP nodes is improved. Further, by evaluating the candidate route, the communication quality between the first location and the second location can be ensured.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for both the system and the central server embodiments, reference may be made to the introduction of embodiments of the method described above in comparison with the explanation.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, 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 a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an embodiment of the present application, and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (13)
1. A method of path planning, the method comprising:
generating a first coverage area adapted to a first position and a second position to be planned, and generating a second coverage area between the first position and the second position; wherein the first coverage area includes the first location and the second coverage area is a geometric figure planned between the first location and the second location;
selecting a first target POP node corresponding to the first position in the first coverage area and the second coverage area, and constructing at least one candidate path containing the first target POP node between the first position and the second position; wherein the first target POP node is selected from an intersection of the first coverage area and the second coverage area;
and acquiring path information of the candidate path, comparing the quality under the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as a planned path between the first position and the second position.
2. The method of claim 1, wherein generating a first coverage area adapted to the first location comprises:
taking the first position as a circle center, taking a specified distance as a radius to form a circle, and taking an area covered by the circle as the first covering area; wherein the specified distance is determined based on a straight-line distance between the first location and the second location.
3. The method of claim 2, wherein the specified distance is determined as follows:
acquiring a linear distance between the first position and the second position, determining a radius coefficient, and taking the product of the linear distance and the radius coefficient as the designated distance; and the number of POP nodes contained in the circle made according to the specified distance is greater than or equal to a first threshold value.
4. The method of claim 1, wherein generating a second coverage area between the first location and the second location comprises:
if the geometric figure meets the preset condition, taking the coverage area of the target geometric figure as the second coverage area; and if not, replanning the geometric figure until the preset condition is met, wherein the preset condition comprises that the number of POP nodes determined to be contained in the geometric figure is greater than or equal to a second threshold value.
5. The method of claim 1, wherein selecting a first target POP node in the first coverage area and the second coverage area comprises:
and if the number of the first target POP nodes selected in the intersection is smaller than a third threshold value, determining a union of the first coverage area and the second coverage area, and continuously selecting the first target POP nodes from the unselected POP nodes in the union.
6. The method of claim 1, wherein correcting the candidate path comprises:
if the operator resource adopted by the first target POP node currently is not matched with the operator resource at the first position, the operator resource adopted by the first target POP node is adjusted, so that the adjusted operator resource is consistent with the operator resource adopted at the first position, or another POP node consistent with the operator resource adopted at the first position is searched in the specified range of the first target POP node, and the first target POP node is replaced by the another POP node.
7. The method of claim 1, wherein correcting the candidate path comprises:
and in the candidate path, if the area passed by the routing path between the first target POP node and the first position comprises other POP nodes, determining a POP node closest to the first position from the other POP nodes, and replacing the first target POP node in the candidate path.
8. The method of claim 1, further comprising:
and sequencing the planned paths according to the path information, and displaying a sequencing result.
9. The method of claim 1, further comprising:
generating a third coverage area adapted to the second location and a fourth coverage area between the second location and the first target POP node;
selecting a second target POP node corresponding to a second location in the third coverage area and the fourth coverage area;
a candidate path between the first location and the second location further comprising the second destination POP node.
10. A path planning system, the system comprising:
a coverage area generating unit, configured to generate, for a first location and a second location to be planned, a first coverage area adapted to the first location, and generate a second coverage area between the first location and the second location; wherein the first coverage area includes the first location and the second coverage area is a geometric figure planned between the first location and the second location;
a candidate path construction unit, configured to select a first target POP node corresponding to the first location in the first coverage area and the second coverage area, and construct at least one candidate path including the first target POP node between the first location and the second location; wherein the first target POP node is selected from an intersection of the first coverage area and the second coverage area;
and the planned path determining unit is used for acquiring the path information of the candidate path, comparing the quality under the path information with a quality threshold value specified under a reference library to judge whether the candidate path needs to be corrected, and taking the candidate path which does not need to be corrected and the corrected candidate path as the planned path between the first position and the second position.
11. The system of claim 10, wherein the planned path determination unit comprises:
and the target transmission node determining module is used for determining a POP node closest to the first position from the other POP nodes to replace the first target POP node in the candidate path if the area of the routing path between the first target POP node and the first position in the candidate path contains other POP nodes.
12. The system of claim 10, wherein the coverage area generation unit is further configured to generate a third coverage area adapted to the second location and generate a fourth coverage area between the second location and the first target POP node;
the system further comprises:
and the second target POP node selection unit is used for selecting a second target POP node corresponding to a second position in the third coverage area and the fourth coverage area and constructing a candidate path containing the second target POP node between the second position and the first target POP node.
13. A central server, characterized in that the central server comprises a memory for storing a computer program which, when executed by the processor, implements the method according to any one of claims 1 to 9 and a processor.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010075430.5A CN111162954B (en) | 2020-01-22 | 2020-01-22 | Path planning method, system and central server |
| PCT/CN2020/079352 WO2021147152A1 (en) | 2020-01-22 | 2020-03-13 | Route planning method and system, and central server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010075430.5A CN111162954B (en) | 2020-01-22 | 2020-01-22 | Path planning method, system and central server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111162954A CN111162954A (en) | 2020-05-15 |
| CN111162954B true CN111162954B (en) | 2021-07-09 |
Family
ID=70565014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010075430.5A Active CN111162954B (en) | 2020-01-22 | 2020-01-22 | Path planning method, system and central server |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111162954B (en) |
| WO (1) | WO2021147152A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112504291B (en) * | 2020-11-17 | 2023-05-23 | 腾讯科技（深圳）有限公司 | Vehicle navigation method and device |
| CN112910698B (en) * | 2021-01-27 | 2023-08-22 | 网宿科技股份有限公司 | CDN coverage scheme adjusting method, device and equipment |
| CN113645157A (en) * | 2021-08-25 | 2021-11-12 | 上海易声通信技术发展有限公司 | Management division-based POP site allocation method and system |
| CN114698047A (en) * | 2022-03-30 | 2022-07-01 | 深圳市信锐网科技术有限公司 | Data transmission method, device, equipment and computer readable storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110601973A (en) * | 2019-08-26 | 2019-12-20 | 中移（杭州）信息技术有限公司 | Route planning method, system, server and storage medium |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7031266B1 (en) * | 2000-02-25 | 2006-04-18 | Cisco Technology, Inc. | Method and system for configuring wireless routers and networks |
| CN101394341B (en) * | 2007-09-17 | 2011-08-03 | 华为技术有限公司 | Route maintaining method, system and apparatus |
| CN102571856B (en) * | 2010-12-17 | 2015-04-22 | 中国移动通信集团公司 | Method, device and system for selecting transition node |
| CN106686034B (en) * | 2015-11-10 | 2019-12-06 | 中国电信股份有限公司 | CDN scheduling enhancement method, device and system |
| CN108075912B (en) * | 2016-11-11 | 2022-09-27 | 中兴通讯股份有限公司 | Method and device for determining network center node and equipment node |
| CN114979973A (en) * | 2016-12-30 | 2022-08-30 | 英特尔公司 | Method and apparatus for radio communication |
| CN109150576B (en) * | 2017-06-28 | 2021-01-05 | 华为技术有限公司 | Content data transmission method and equipment |
| CN109547872B (en) * | 2017-09-21 | 2021-08-24 | 中国移动通信集团设计院有限公司 | Network planning method and device |
| US10462216B1 (en) * | 2018-05-04 | 2019-10-29 | Citrix Systems, Inc. | WebRTC API redirection with interception techniques |
| CN109660624B (en) * | 2018-12-26 | 2022-05-17 | 网宿科技股份有限公司 | Planning method, server and storage medium for content distribution network resources |
| CN109495901B (en) * | 2018-12-27 | 2022-03-11 | 南京未来网络产业创新有限公司 | Topology self-adaptive private network establishing method |
-
2020
- 2020-01-22 CN CN202010075430.5A patent/CN111162954B/en active Active
- 2020-03-13 WO PCT/CN2020/079352 patent/WO2021147152A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110601973A (en) * | 2019-08-26 | 2019-12-20 | 中移（杭州）信息技术有限公司 | Route planning method, system, server and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021147152A1 (en) | 2021-07-29 |
| CN111162954A (en) | 2020-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111162954B (en) | Path planning method, system and central server | |
| CN107517228B (en) | Dynamic acceleration method and device in content distribution network | |
| CN110149675B (en) | UPF selection method and device | |
| Zhang et al. | An opportunistic resource sharing and topology-aware mapping framework for virtual networks | |
| US8850026B2 (en) | Methods and apparatus to allocate resources associated with a distributive computing network | |
| CN104809129B (en) | A kind of distributed data storage method, device and system | |
| CN111817868B (en) | Method and device for positioning network quality abnormity | |
| US9680665B2 (en) | Apparatus and method for dynamic hybrid routing in SDN networks to avoid congestion and balance loads under changing traffic load | |
| CN110380960B (en) | Backup path determining method, device, network equipment and storage medium | |
| US20180365339A1 (en) | Application classification method and apparatus | |
| Vasconcelos et al. | Cloud, fog, or mist in IoT? That is the question | |
| CN113973026B (en) | Site interconnection method, central controller and route reflector | |
| CN107154959A (en) | A kind of method and apparatus of the access network address | |
| CN113676511A (en) | Cloud storage method, system, equipment and storage medium | |
| CN113300868B (en) | Positioning method and device for fault network equipment node and network communication method | |
| CN109271438A (en) | A kind of data bank access method and its system | |
| CN113268550A (en) | Method and system for scheduling autonomous domain system, electronic device and storage medium | |
| CN113162814B (en) | Network quality reference library generation method, system and central server | |
| CN114244805B (en) | Domain name configuration method and device | |
| CN110958666A (en) | Network slice resource mapping method based on reinforcement learning | |
| Oest et al. | Constraint-based modeling of smart grid services in ict-reliant power systems | |
| CN112532448B (en) | Network topology processing method and device and electronic equipment | |
| CN113301003B (en) | Information and data link detection method, device and storage medium | |
| Chang et al. | An optimization model to determine data center locations for the army enterprise | |
| Philippe | Impact of complex network properties on routing in backbone networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |