Transport capacity circle drawing method, system and device based on network time delay value and medium

Abstract

The invention relates to the technical field of communication, in particular to a transport capacity circle drawing method, system and device based on a network time delay value and a medium, and the method comprises the steps: obtaining transport capacity node information in a communication network, the node information comprising latitude and longitude information and the network time delay value; filtering out a transport capacity node set corresponding to a network time delay value from the node information based on the specified network time delay value; drawing a convex polygon containing all the transport capacity nodes in the transport capacity node set by adopting a divide-and-conquer method; and performing curvilinear processing on the convex polygon by adopting an increase point normal form polygon curvilinear algorithm to obtain a transport circle corresponding to a specified network time delay value in the communication network. According to the method, the network time delay transport power circle graph can be displayed visually and efficiently, transport power circle boundaries with different time delay values are distinguished, the intersection phenomenon of transport power circles with different time delay values can be effectively avoided, and dissimilation scenes when convex polygons cannot be constructed among nodes can be processed.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a method, system, device and medium for drawing a capacity circle based on network delay values. Background Art

[0002] In the field of communications, there are a large number of GIS map and topology drawing scenarios. With the development of cloud computing, AI and other technologies, digital applications are showing a trend of centralized deployment. It is necessary to concretely identify the delay information of multiple computing centers that meet the preset delay value, determine the multiple computing centers that meet the specified delay conditions with the target computing center, and use curve circles to visually describe such delay relationships, and directly display the capacity coverage model in a visual way. The model showing the capacity coverage can also be called a capacity circle.

[0003] Currently, there is no unified standard for the technical solutions for drawing curve circles based on network delay values ​​and coordinate information, and relevant technical literature is also lacking. The technical solution of the present invention proposes a new idea for drawing capacity circles. Summary of the invention

[0004] To solve the above problems, the present invention provides a method, system, device and medium for drawing a capacity circle based on network delay values. The method can visualize and efficiently display the network delay capacity circle graphics, distinguish the boundaries of capacity circles with different delay values, effectively avoid the intersection of capacity circles with different delay values, and handle the alienation scenario when convex polygons cannot be constructed between nodes.

[0005] To achieve the above object, the present invention adopts the following technical solution:

[0006] In a first aspect, the present invention provides a method for drawing a capacity circle based on a network delay value, comprising:

[0007] Obtain the capacity node information in the communication network, which includes latitude and longitude information and network delay value;

[0008] Based on the specified network delay value, filter out the capacity node set corresponding to the network delay value from the node information;

[0009] Using the divide-and-conquer method, draw a convex polygon that contains all the capacity nodes in the capacity node set;

[0010] The polygon curve algorithm of the point-adding paradigm is used to curve the convex polygon and obtain the capacity circle corresponding to the specified network delay value in the communication network.

[0011] Furthermore, a divide-and-conquer method is used to draw a convex polygon containing all the capacity nodes in the capacity node set, including:

[0012] Select a node in the transport node set as the origin (0,0) to create a two-dimensional coordinate system; for other nodes in the transport node set except the origin, set their (x,y) coordinates in the two-dimensional coordinate system according to the latitude and longitude values ​​and offset angle relative to the origin;

[0013] Obtain the node P1 with the smallest horizontal coordinate and the node Pn with the largest horizontal coordinate in the two-dimensional coordinate system, where the node P1 and the node Pn are vertices of the convex polygon; use the straight line P1Pn connected by the node P1 and the node Pn to divide all the nodes in the two-dimensional coordinate system into an upper package and a lower package;

[0014] Based on the Pmax algorithm combined with the straight line segmentation method, the vertices of all convex polygons in the upper and lower packages are determined;

[0015] Based on the vertices of all convex polygons in the node P1, the node Pn, the upper package and the lower package, a convex polygon containing all the capacity nodes in the capacity node set is drawn.

[0016] Furthermore, based on the Pmax algorithm combined with the straight line segmentation method, the vertices of all convex polygons in the upper and lower packages are determined, including:

[0017] a. Use the Pmax algorithm to determine the node Pmax in the upper package that is farthest from the straight line P1Pn as the vertex of the convex polygon;

[0018] b. Use the straight line P1Pmax connecting the node P1 and the node Pmax and the straight line P1Pmax connecting the node P1 and the node Pmax to split the upper package into a new upper package and a new lower package;

[0019] c. Repeat the processing logic of steps ab for the new upper package until all the vertices of the convex polygons in the upper package are determined;

[0020] d. Use the same processing logic as steps ac to determine the vertices of all convex polygons in the lower package.

[0021] Furthermore, the polygon curve algorithm of the point-adding paradigm is used to curve the convex polygon to obtain the capacity circle corresponding to the specified network delay value in the communication network, including:

[0022] Control points are added to the vertical midline outside each side of the convex polygon. The vertices on each side of the convex polygon and the control points form a new convex polygon. The new convex polygon is the capacity circle corresponding to the specified network delay value in the communication network.

[0023] Furthermore, the distance from the control point to the edge of the corresponding convex polygon can be dynamically adjusted as needed.

[0024] Furthermore, the convex polygon is curved by using the point-adding paradigm polygon curve algorithm, and the execution times of the capacity circle steps corresponding to the specified network delay value in the communication network can be dynamically adjusted as needed.

[0025] Furthermore, the method also includes, when the network delay value is specified as multiple values, obtaining multiple corresponding capacity circles, using an intersection contour algorithm to perform intersection detection on the multiple capacity circles, and obtaining a capacity circle with intersection nodes removed.

[0026] In a second aspect, the present invention further provides a capacity circle drawing system based on network delay value, comprising:

[0027] The acquisition module is used to obtain the capacity node information in the communication network. The node information includes longitude and latitude information and network delay value;

[0028] A filtering module is used to filter out a set of transport nodes corresponding to a specified network delay value from node information based on the specified network delay value;

[0029] A drawing module, used to draw a convex polygon containing all the transport nodes in the transport node set by using a divide-and-conquer method;

[0030] The processing module is used to use the point-adding paradigm polygon curve algorithm to curve the convex polygon and obtain the capacity circle corresponding to the specified network delay value in the communication network.

[0031] In a third aspect, the present invention further provides an electronic device, comprising: a processor and a memory;

[0032] The processor is coupled to the memory;

[0033] The processor is used to read and execute the program or instructions stored in the memory, so that the device executes the method of the first aspect.

[0034] In a fourth aspect, the present invention further provides a computer-readable storage medium storing a computer program, which implements the method of the first aspect when executed by a processor.

[0035] The technical solution provided by the present invention has at least the following technical effects or advantages:

[0036] (1) The complex problem of drawing convex polygons is decomposed into sub-problems of determining the vertices of convex polygons by using the divide-and-conquer method. By recursively processing the sub-problems, the efficiency of drawing convex polygons can be significantly improved.

[0037] (2) The point-adding paradigm polygonal curve algorithm can easily adjust the control points;

[0038] (3) By applying advanced mathematics and geometric mathematics knowledge, intersection detection and k value tuning are added to the algorithm to achieve self-detection of the entire calculation process and a closed loop of automatic tuning to obtain a reasonable drawing solution;

[0039] (4) The technical solution of the present invention has been verified by engineering. The curve circle is drawn without distortion in the case of large data volume, and the running speed is stable and reliable, with good performance.

[0040] (5) The technical solution of the present invention is constructed on the basis of mathematical modeling, plane geometry, and linear algebra, and the theoretical knowledge is reliable and complete;

[0041] (6) In the process of computer programming implementation, it is not restricted by programming languages ​​and has a wide range of application scenarios.

[0042] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0044] Figure 1 A schematic diagram of a flow chart of a method for drawing a capacity circle based on a network delay value in an embodiment of the present invention;

[0045] Figure 2 A schematic diagram of the principle of drawing a convex polygon in an embodiment of the present invention;

[0046] Figure 3 Schematic diagram of the principle of polygonal curve formation using point-adding paradigm in an embodiment of the present invention;

[0047] Figure 4 It is a schematic diagram of a capacity circle drawn based on a network delay value in an embodiment of the present invention;

[0048] Figure 5 It is a flowchart of another method for drawing a capacity circle based on network delay value in an embodiment of the present invention;

[0049] Figure 6 A schematic diagram of the structure of a capacity circle drawing system based on network delay value in an embodiment of the present invention;

[0050] Figure 7The present invention is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0051] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0052] The technical solution of the present invention obtains the optimal solution through the divide-and-conquer idea, mathematical modeling, linear algebra, intersection detection, and autonomous tuning to construct a graphical drawing method for the network delay capacity circle. This method can visually display the network delay capacity circle graph, distinguish the boundaries of capacity circles with different delay values, and can effectively avoid the intersection phenomenon of capacity circles with different delay values. It can handle the alienation scenario when convex polygons cannot be constructed between nodes.

[0053] Figure 1 The flowchart of a method for drawing a capacity circle based on network delay value in an embodiment of the present invention is shown in the figure. As shown in the figure, the method includes:

[0054] S101. Acquire capacity node information in the communication network, where the node information includes latitude and longitude information and network delay value;

[0055] Obtain all capacity node information in the communication network. The node information includes longitude and latitude information and network delay value. Draw a capacity circle based on the network delay value according to the capacity node information.

[0056] The capacity circle based on network delay value can be drawn based on multiple scenarios such as GIS map model, topology map, two-dimensional coordinate system, etc., such as constructing a GIS map node model corresponding to all capacity nodes and drawing it in the GIS map node model.

[0057] S102. Based on the specified network delay value, filter out a set of transport nodes corresponding to the network delay value from the node information;

[0058] In the field of network communications and cloud computing, network latency is a key performance indicator, which refers to the time required for a data packet to be transmitted from one network node to another. Network latency has a direct impact on the quality of many applications and services. Network latency is not only related to the end-user experience, but also an important basis for evaluating and optimizing the performance of the entire communication network architecture. Drawing a capacity circle based on a specified network latency value can intuitively identify the computing center and its coverage area that meet specific latency requirements, which is essential for achieving efficient and reliable data processing and transmission.

[0059] According to the specified network delay value, a set of capacity nodes L that meet the network delay value requirements is filtered out from all capacity node information in the communication network.

[0060] S103, using a divide-and-conquer method, drawing a convex polygon containing all the transport nodes in the transport node set;

[0061] Divide and conquer is an algorithm design technique for solving problems. It decomposes a complex problem into two or more identical or similar sub-problems until the final sub-problem can be solved simply and directly. Each sub-problem is solved recursively, and then their solutions are merged to obtain the solution to the original problem. This method can usually significantly improve the efficiency of solving certain types of problems. In the present invention, the divide and conquer method is used to decompose the problem of drawing convex polygons into sub-problems of determining the vertices of the convex polygon. All the vertices of the convex polygon are determined recursively, and then the minimum convex polygon containing all the capacity nodes in the capacity node set is drawn based on all the vertices. The convex polygon can also be called a convex hull. In two-dimensional space, if any two nodes are selected and connected to form a line segment, then all nodes on this line segment must be located or inside the convex polygon.

[0062] The following are some examples:

[0063] Select a node in the transport node set L as the origin (0,0) to create a two-dimensional coordinate system CS; for other nodes in the transport node set except the origin, set their (x,y) coordinates in the two-dimensional coordinate system according to the latitude and longitude values ​​and offset angle relative to the origin;

[0064] Get the node P1 with the smallest horizontal coordinate and the node Pn with the largest horizontal coordinate in the two-dimensional coordinate system. Node P1 and node Pn are vertices of a convex polygon, that is, node P1 and node Pn are vertices of a convex hull (which can be determined by the inverse method); use the straight line P1Pn connected by the node P1 and the node Pn to divide all the nodes in the two-dimensional coordinate system into an upper hull and a lower hull.

[0065] Based on the Pmax algorithm combined with the straight line segmentation method, the vertices of all convex polygons in the upper and lower packages are determined, including the following steps:

[0066] a. Use the Pmax algorithm to determine the node Pmax in the upper package that is farthest from the straight line P1Pn as the vertex of the convex polygon;

[0067] The Pmax algorithm specifically refers to:

[0068] Suppose there is a node P3 and a line P1P2, where P1P2 is the line connecting the nodes P1 and P2, and the coordinates of P1, P2, and P3 are P1(x1, y1), P2(x2, y2), and P3(x3, y3) respectively;

[0069] Based on the coordinates of P1, P2, and P3, the absolute value of the result of the third-order determinant formula is taken. The larger the absolute value, the farther P3 is from the straight line P1P2. The expression for the absolute value of the result of the third-order determinant formula is:

[0070]

[0071] The Pmax algorithm is used to determine the node Pmax in the upper hull that is farthest from the straight line P1Pn. The node Pmax is the vertex of the convex polygon, that is, the vertex of the convex hull.

[0072] b. Use the straight line P1Pmax connecting the node P1 and the node Pmax and the straight line PnPmax connecting the node Pn and the node Pmax to split the upper package into a new upper package and a new lower package;

[0073] Exemplary, for example, the two straight lines P1Pmax and PnPmax are used as dividing lines to divide the upper package into a new upper package and a new lower package, that is, the nodes on the left side of the straight line P1Pmax are used as the new upper package, and the nodes on the right side of the straight line P1Pmax are used as the new lower package; the nodes on the right side of the straight line PnPmax are used as the new upper package, and the nodes on the left side of PnPmax are used as the new lower package.

[0074] c. Repeat the processing logic of steps ab for the new upper package until all the vertices of the convex polygons in the upper package are determined;

[0075] d. Use the same processing logic as steps ac to determine the vertices of all convex polygons in the lower package.

[0076] Based on the vertices of all convex polygons in node P1, node Pn, upper package and lower package, a convex polygon containing all capacity nodes in the capacity node set is drawn. The convex polygon contains all capacity nodes that meet the network delay value requirements.

[0077] Figure 2 The figure is a schematic diagram of the principle of drawing a convex polygon in an embodiment of the present invention.

[0078] S104, using the point-adding paradigm polygon curve algorithm to curve the convex polygon to obtain the capacity circle corresponding to the specified network delay value in the communication network.

[0079] The current mainstream technology route for convex polygon curve conversion mainly uses the Chaikin method. The Chaikin method uses a fixed ratio for corner cutting operations. Given a control polygon, the original control polygon is refined by generating a series of new control points, where each pair of new points Qi, Ri will be calculated as a point with a ratio of 1 / 4 and 3 / 4 between the endpoints of the line segment. Since the Chaikin method uses the corner cutting paradigm, the range of the capacity circle will gradually become smaller and cannot meet the requirements of including the original points. It can be seen that the main problems of this drawing method are as follows:

[0080] (1) Adaptability pain points: The Chaikin method or other convex polygon curve conversion ideas use corner cutting ideas or Bezier curve-like thinking, which will lead to the problem that the generated curve circle cannot contain the original node.

[0081] (2) Computational pain points: Conventional curve thinking requires the use of geometric operations to expand the curve circle to include the relevant original nodes, which requires increasing the computational burden of collision detection and related geometric conversion.

[0082] The technical solution of the present invention can solve the shortcomings of using the Chaikin method to curve convex polygons. In a specific implementation, step S104 includes:

[0083] A control point is added to the vertical midline outside each side of the convex polygon. The vertices on each side of the convex polygon and the control point form a new node set. Based on the new node set, a new convex polygon is obtained by using the processing logic of step S103. The new convex polygon is the capacity circle corresponding to the specified network delay value in the communication network. The distance from the control point to the corresponding convex polygon edge can be dynamically adjusted as needed.

[0084] For example,

[0085] Set dis=1 / 10 (adjustable value) outside the vertical midline of each side of the convex polygon to add a control point to generate a new convex polygon. The value of dis is the distance from the control point to the corresponding edge of the convex polygon. This value can be dynamically adjusted as needed. Here, dis=1 / 10 means 1 / 10 of the length of the convex polygon edge corresponding to the control point.

[0086] In the step of adding a control point on the vertical midline outside each side of the convex polygon, it is necessary to calculate the coordinates of the control point in the two-dimensional coordinate system CS, which is specifically calculated based on the direction vector of the convex polygon line segment.

[0087] If the two endpoints of the line segment are startPoint and endPoint, the steps to obtain the control point are as follows:

[0088] Calculate the direction vector of the line segment:

[0089] Get the normalized vector value:

[0090] Get the coordinates of the control points:

[0091] (startPoint.x+dx×distance, startPoint.y+dy×distance)

[0092] The convex polygon is processed into a curve using the point-increasing paradigm polygon curve algorithm, and the execution times of the capacity circle step corresponding to the specified network delay value in the communication network can be dynamically adjusted as needed. That is, step S104 can be repeated k (default 100) times as needed.

[0093] For example, in terms of front-end performance optimization, the longest task time that customers can generally tolerate is 50ms. The dynamic tuning of the k value includes: adding a time tag to the capacity circle drawing process. If the k value meets the relevant performance requirements under the default value, the k value can be appropriately increased, and then the number of points can be increased to achieve a softer curve effect. If there are many computing nodes and a balance between performance and visual presentation is required, the k value can be appropriately reduced, and then the number of points can be reduced. The dynamic tuning of the increase or decrease of the k value can be automatically adjusted according to the front-end performance requirements during the method operation.

[0094] Figure 3 Schematic diagram of the principle of polygonal curve formation using point-adding paradigm in an embodiment of the present invention;

[0095] Figure 4 This is a schematic diagram of a capacity circle drawn based on network delay values ​​in an embodiment of the present invention.

[0096] In the implementation process of the present invention, if the specified network delay value is multiple values, multiple corresponding capacity circles are obtained, and the intersection contour algorithm is used to perform intersection detection on the multiple capacity circles to obtain the capacity circle with the intersection nodes removed. The goal of the polygon intersection contour algorithm is to calculate the intersection contours of the convex polygons corresponding to the multiple capacity circles and find the boundaries of the overlapping parts.

[0097] Taking two capacity circles that need to be intersected as an example, the steps are as follows:

[0098] a. Get the first vertex set of the convex polygons corresponding to the two transport circles that need to intersect;

[0099] b. For each convex polygon, traverse all its boundary segments and check whether the boundary segment intersects with another convex polygon. If so, obtain the intersection information; that is, by traversing each boundary segment of the convex polygon and each boundary segment of another convex polygon to see whether there is an intersection, if there is an intersection, obtain the intersection information by calculation;

[0100] Exemplarily, the coordinates of the four nodes corresponding to the two intersecting boundary line segments are (x1, y1), (x2, y2), (x3, y3), (x4, y4), and the intersection of the two boundary line segments is calculated as follows:

[0101] Intermediate variables:

[0102] Calculate the denominator: denominator = a × eb × d;

[0103] Intersection point: x-axis coordinate of intersection point Px = (c×ef×b) / denominator;

[0104] The y-axis coordinate of the intersection point Py = (a × fc × d) / denominator;

[0105] c. Cache all intersection information calculated by traversing all boundary lines into an array to obtain an intersection array;

[0106] d. Filter the first vertex set, remove the nodes corresponding to the intersection array, and obtain a new second vertex set of convex polygons corresponding to the two capacity circles that need to intersect. The capacity circle corresponding to the second vertex set is the capacity circle without the intersection nodes.

[0107] The dynamic tuning of the k value can also be performed after the intersection detection of multiple capacity circles is performed using the intersection contour algorithm to obtain the capacity circle with the intersection nodes removed.

[0108] The technical solution of the present invention provides a general method for convex polygon curve conversion, which expands the thinking dimension for the same type of technical problems. Compared with the traditional subtractive thinking, the solution of the present invention can better control the relevant alienation requirements through the program through the incremental thinking algorithm, which expands the idea of ​​the convex polygon curve algorithm.

[0109] The technical solution of the present invention also has the following advantages:

[0110] (1) The complex problem of drawing convex polygons is decomposed into sub-problems of determining the vertices of convex polygons by using the divide-and-conquer method. By recursively processing the sub-problems, the efficiency of drawing convex polygons can be significantly improved.

[0111] (2) The point-adding paradigm polygonal curve algorithm can easily adjust the control points;

[0112] (3) By applying advanced mathematics and geometric mathematics knowledge, intersection detection and k value tuning are added to the algorithm to achieve self-detection of the entire calculation process and a closed loop of automatic tuning to obtain a reasonable drawing solution;

[0113] (4) The technical solution of the present invention has been verified by engineering. The curve circle is drawn without distortion in the case of large data volume, and the running speed is stable and reliable, with good performance.

[0114] (5) The technical solution of the present invention is constructed on the basis of mathematical modeling, plane geometry, and linear algebra, and the theoretical knowledge is reliable and complete;

[0115] (6) In the process of computer programming implementation, it is not restricted by programming languages ​​and has a wide range of application scenarios.

[0116] The technical solution of the present invention can draw the capacity circle based on the network delay value based on multiple scenarios such as GIS map model and topology map. The following is an embodiment based on the GIS map model:

[0117] 1. Obtain all the capacity node information in the communication network, build the GIS map node model corresponding to all the capacity nodes, and draw convex polygons based on the network delay value in the GIS map node model;

[0118] 2. Curve the convex polygon to obtain the capacity circle corresponding to the specified network delay value in the communication network;

[0119] 3. In the process of obtaining the capacity circle corresponding to the specified network delay value in the communication network, the capacity circle is optimized by using intersection detection and K value tuning.

[0120] The specific implementation process is as follows:

[0121] M1: Build the GIS model of all nodes in the capacity circle that need to be drawn, and draw the Gis node model of each delay value node information;

[0122] M2: Get the convex polygon information of all nodes related to the specified delay value. Use the third-order determinant to simplify the thinking and calculate the information of each node on the convex hull in turn.

[0123] M3: Calculate the M2 step by adding points to get the curve circle of the convex polygon. Use the calculation of adding control points to get a new convex polygon, control the number of executions of the relevant M3 step by the k value, and generate the curve circle point matrix of the convex polygon.

[0124] M4: Repeat steps M2 and M3 to draw curve circles of other specified delay values.

[0125] M5: Perform intersection detection on the drawn delay value curve circles and delete the intersection parts of multiple curve circles. The underlying principle of intersection detection is based on calculating the intersection points of two line segments, recombining the original points and the intersection points to form a new set, and drawing a new curve circle without the intersection area.

[0126] M6: Perform autonomous k value tuning on the drawn curve circle to improve related performance and view presentation. The k value tuning is mainly to achieve an effective balance between UI display and computing performance.

[0127] Figure 5 The present invention is a flowchart of another method for drawing a capacity circle based on network delay value in an embodiment of the present invention.

[0128] Figure 6 This is a structural schematic diagram of a capacity circle drawing system based on network delay value in an embodiment of the present invention. As shown in the figure, the system includes:

[0129] The acquisition module is used to obtain the capacity node information in the communication network. The node information includes longitude and latitude information and network delay value;

[0130] A filtering module is used to filter out a set of transport nodes corresponding to a specified network delay value from node information based on the specified network delay value;

[0131] A drawing module, used to draw a convex polygon containing all the transport nodes in the transport node set by using a divide-and-conquer method;

[0132] The processing module is used to use the point-adding paradigm polygon curve algorithm to curve the convex polygon and obtain the capacity circle corresponding to the specified network delay value in the communication network.

[0133] It should be noted that, for the sake of convenience, Figure 6 For example, only the main modules of the capacity circle drawing system structure based on network delay value are shown. In practical applications, the system may also include modules or components not shown in the figure; the system is not limited to the above module structure, but may also be other module structures that implement the above method embodiments.

[0134] Figure 7 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. As shown in the figure, the electronic device includes: a processor and a memory;

[0135] The processor is used to read and execute programs and instructions stored in the memory, so that the electronic device executes the above method embodiment.

[0136] It should be noted that, for the sake of convenience, Figure 7For example, only the main components of the electronic device are shown. In actual applications, the electronic device may also include components or assemblies not shown in the figure.

[0137] The present invention also provides a computer-readable storage medium storing a program or instruction. When a computer reads and executes the program or instruction, the computer executes the above method embodiment.

[0138] Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent substitutions for some of the technical features therein; and these modifications or substitutions do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for drawing a capacity circle based on network delay value, characterized in that: include: Obtaining capacity node information in the communication network, wherein the node information includes latitude and longitude information and network delay value; Based on the specified network delay value, filtering out a set of capacity nodes corresponding to the network delay value from the node information; Using a divide-and-conquer method, a convex polygon is drawn that includes all the transport nodes in the transport node set; The convex polygon is subjected to curve processing by adopting the polygon curve conversion algorithm of the point-added paradigm, so as to obtain the capacity circle corresponding to the specified network delay value in the communication network.

2. The method for drawing a capacity circle based on network delay value according to claim 1 is characterized in that: The divide-and-conquer method is used to draw a convex polygon containing all the capacity nodes in the capacity node set, including: A two-dimensional coordinate system is created by selecting a node in the transport node set as the origin (0,0); for other nodes in the transport node set except the origin, the (x,y) coordinates in the two-dimensional coordinate system are set according to the latitude and longitude values ​​and the offset angle relative to the origin; Obtain a node P1 with the smallest horizontal coordinate and a node Pn with the largest horizontal coordinate in the two-dimensional coordinate system, wherein the node P1 and the node Pn are vertices of a convex polygon; use a straight line P1Pn connected by the node P1 and the node Pn to divide all nodes in the two-dimensional coordinate system into an upper package and a lower package; Based on the Pmax algorithm combined with the straight line segmentation method, the vertices of all convex polygons in the upper and lower packages are determined; Based on the vertices of all convex polygons in the node P1, the node Pn, the upper package and the lower package, a convex polygon containing all the capacity nodes in the capacity node set is drawn.

3. The method for drawing a capacity circle based on network delay value according to claim 2 is characterized in that: The method based on the Pmax algorithm combined with the straight line segmentation method determines the vertices of all convex polygons in the upper and lower packages, including: a. Use the Pmax algorithm to determine the node Pmax in the upper package that is farthest from the straight line P1Pn as the vertex of the convex polygon; b. Use the straight line P1Pmax connecting the node P1 and the node Pmax and the straight line P1Pmax connecting the node P1 and the node Pmax to split the upper package into a new upper package and a new lower package; c. Repeat the processing logic of steps ab for the new upper package until all the vertices of the convex polygons in the upper package are determined; d. Use the same processing logic as steps ac to determine the vertices of all convex polygons in the lower package.

4. The method for drawing a capacity circle based on network delay value according to claim 1, characterized in that: The method of using the point-added paradigm polygon curve-forming algorithm to curve-form the convex polygon to obtain a capacity circle corresponding to a specified network delay value in the communication network includes: Control points are added to the vertical midline outside each side of the convex polygon. The vertices on each side of the convex polygon and the control points form a new convex polygon. The new convex polygon is the capacity circle corresponding to the specified network delay value in the communication network.

5. The method for drawing a capacity circle based on network delay value according to claim 4 is characterized in that: The distance from the control point to the edge of the corresponding convex polygon can be dynamically adjusted as needed.

6. The method for drawing a capacity circle based on network delay value according to claim 1, characterized in that: The convex polygon is subjected to curve processing by adopting the polygon curve forming algorithm of the point adding paradigm, and the execution times of the capacity circle steps corresponding to the specified network delay value in the communication network can be dynamically adjusted as needed.

7. The method for drawing a capacity circle based on network delay value according to claim 1, characterized in that: The method also includes, when the designated network delay value is a plurality of values, obtaining a plurality of corresponding capacity circles, and using an intersection contour algorithm to perform intersection detection on the plurality of capacity circles to obtain a capacity circle with intersection nodes removed.

8. A capacity circle drawing system based on network delay value, characterized in that: include: An acquisition module is used to acquire capacity node information in the communication network, wherein the node information includes latitude and longitude information and network delay value; A filtering module, configured to filter out a set of transport nodes corresponding to a specified network delay value from the node information based on the specified network delay value; A drawing module, used for drawing a convex polygon containing all the transport nodes in the transport node set by using a divide-and-conquer method; The processing module is used to use the point-adding paradigm polygon curve algorithm to curve the convex polygon to obtain a capacity circle corresponding to a specified network delay value in the communication network.

9. An electronic device, characterized in that: include: Processor and memory; The processor is coupled to a memory; The processor is used to read and execute the program or instruction stored in the memory, so that the device executes the method according to any one of claims 1 to 7.

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

Images