Network service management method, device, equipment, medium and program product

Abstract

The invention provides a network service management method and device, equipment, a medium and a program product. Comprising the following steps: dividing a tail end grid into different region types; each area type corresponds to one FAP box body coverage radius range; performing Thiessen polygon algorithm division on the potential FAP box bodies in the tail end grid to obtain a potential coverage range of each potential FAP box body; according to the potential coverage range corresponding to each potential FAP box body and the set coverage range of each potential FAP box body, setting an FAP box body in the tail end grid; determining light path information from each FAP box body to the convergence machine room through a graph traversal algorithm according to a preset light path rule, and obtaining a light path information set from the FAP box bodies to the convergence machine room; and selecting target optical path information from the optical path information set from the FAP box body to the convergence machine room according to the service requirement of the access service. By adopting the method provided by the embodiment of the invention, the efficiency and accuracy of the network service management method can be improved.

Description

Technical Field

[0001] The present disclosure relates to the field of big data technology, and in particular to a network service management method, device, equipment, medium and program product. Background Art

[0002] In the related technologies, the network service management method, including the terminal access grid and FAP planning and construction, is mainly displayed and managed in a layered and gridded manner through traditional CAD (Computer Aided Design) platforms, Google Earth platforms, etc., and the latitude and longitude are used to realize the annotation of points, lines, and blocks, so as to plan, build, and operate and manage business points, FAP (Fiber Access Point, unified access fiber point) points, pipeline resources, and computer room physical points. However, at this stage, the terminal access grid is mainly divided manually on the traditional platform, and the terminal unified access fiber point (FAP) is set based on business needs and subjective experience, which will lead to low efficiency and low accuracy of the network service management method. Summary of the invention

[0003] The present disclosure discloses a network service management method, device, equipment, medium and program product. The technical solution of the present disclosure is as follows:

[0004] In a first aspect, the present disclosure discloses a network service management method, comprising:

[0005] Based on the latitude and longitude layers of the terminal grid, the terminal grid is divided into different area types in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, optical cross-box information, ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each of the area types corresponds to a FAP box coverage radius range;

[0006] Dividing the potential FAP box in the terminal grid by using the Thiessen polygon algorithm to obtain the potential coverage of each potential FAP box;

[0007] According to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes, a FAP box is set in the terminal grid; wherein the set coverage range is determined based on the coverage radius range of the FAP box corresponding to each of the area types;

[0008] Determine the optical path information from each FAP cabinet to the convergence room according to the preset optical path rule through a graph traversal algorithm, and obtain an optical path information set from the FAP cabinet to the convergence room;

[0009] According to the service requirements of the access service, the target optical path information is selected from the optical path information set from the FAP cabinet to the aggregation room.

[0010] In a second aspect, the present disclosure discloses a network service management device, comprising:

[0011] A region division module is used to divide the terminal grid into different region types based on the latitude and longitude layers of the terminal grid division and in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, the optical cross-box information, the ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each of the region types corresponds to a FAP box coverage radius range;

[0012] A polygon partitioning module, used for performing Thiessen polygon partitioning on the potential FAP box in the terminal grid to obtain a potential coverage range of each potential FAP box;

[0013] A box setting module, used to set the FAP box in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes; wherein the set coverage range is determined based on the FAP box coverage radius range corresponding to each of the area types;

[0014] An optical path module, used to determine the optical path information from each FAP cabinet to the convergence room according to a preset optical path rule through a graph traversal algorithm, and obtain an optical path information set from the FAP cabinet to the convergence room;

[0015] The optical path selection module is used to select target optical path information from the optical path information set from the FAP box to the aggregation room according to the service requirements of the access service.

[0016] In a third aspect, the present disclosure discloses an electronic device, including:

[0017] processor;

[0018] a memory for storing instructions executable by the processor;

[0019] The processor is configured to execute the instructions to implement the method described in the first aspect.

[0020] In a fourth aspect, the present disclosure discloses a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the method described in the first aspect when executed by a processor.

[0021] In a fifth aspect, the present disclosure discloses a computer program product, including a computer program / instructions, characterized in that when the computer program / instructions are executed by a processor, the method described in the first aspect is implemented.

[0022] The technical solution disclosed in this disclosure brings at least the following beneficial effects:

[0023] In an embodiment of the present disclosure, the terminal grid is divided into different area types based on the latitude and longitude layer divided by the terminal grid and in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, optical cross-box information, ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each area type corresponds to a FAP box coverage radius range; the potential FAP boxes in the terminal grid are divided by the Thiessen polygon algorithm to obtain the potential coverage range of each potential FAP box; the FAP box is set in the terminal grid according to the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box; wherein the set coverage range is determined based on the FAP box coverage radius range corresponding to each area type; the optical path information from each FAP box to the convergence room is determined according to the preset optical path rule through the graph traversal algorithm, and the optical path information set from the FAP box to the convergence room is obtained; according to the service requirements of the access service, the target optical path information is selected from the optical path information set from the FAP box to the convergence room. In this way, the Thiessen polygon algorithm can be used to evaluate the coverage density and layout rationality of the FAP in the terminal grid. By calculating the Thiessen polygons of each FAP box, the potential coverage range of the FAP in the terminal grid can be determined, and the FAP box can be set in the terminal grid; the graph traversal algorithm can also be used to realize the intelligent analysis of end-to-end resources and optimize the dynamic routing scheme of service access; and based on the business needs of the access business, the better target optical path information can be automatically output to achieve the access optical path routing scheme. In this way, the Thiessen polygon algorithm and the traversal algorithm can be applied to the FAP point selection and routing decision, realizing the scientific planning of FAP points in the optical cable network and the intelligent analysis of end-to-end resources, thereby effectively improving the efficiency and accuracy of the network service management method.

[0024] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description are used to explain the principles of the present disclosure, and do not constitute improper limitations on the present disclosure.

[0026] Figure 1A flowchart of a network service management method provided by an embodiment of the present disclosure;

[0027] Figure 2 It is a logical schematic diagram of a Thiessen polygon algorithm provided by an embodiment of the present disclosure;

[0028] Figure 3 is a schematic diagram of a Thiessen polygon provided by an embodiment of the present disclosure, which is a concave polygon;

[0029] Figure 4 It is a logical schematic diagram of a network service management method provided by an embodiment of the present disclosure;

[0030] Figure 5 is a structural diagram of a network service management device provided by an embodiment of the present disclosure;

[0031] Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0032] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.

[0033] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0034] It should be noted that the information (including but not limited to user device information, user personal information, etc.), data (including but not limited to data used for analysis, stored data, displayed data, etc.) and signals involved in this disclosure are all authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data need to comply with relevant laws, regulations and standards of relevant countries and regions.

[0035] The acquisition, storage, use, and processing of data in the technical solution disclosed in this disclosure are in compliance with the relevant provisions of national laws and regulations.

[0036] It should be noted that in the embodiments of the present disclosure, there may be existing solutions in the industry such as certain software, components, models, etc., which should be regarded as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of the present disclosure, but it does not mean that the applicant has or will necessarily use the solution.

[0037] In the related technologies, terminal access grid and FAP planning and construction are mainly carried out through traditional CAD (Computer Aided Design) platforms, Google Earth platforms, etc. for layered, gridded display and resource planning management. These platforms have difficulties in obtaining the basic map, especially in suburbs, new planning areas, suburbs, and township planning, which are prone to become planning blind spots. The accuracy of information points is not high, and it is necessary to edit online on the Google Earth specific platform. The display and output of results are inconvenient, and it is difficult to form a unified platform to dive into the operation of the entire production domain process. Moreover, at this stage, there is still a gap in the evaluation system for the coverage density and layout rationality of FAPs in the terminal grid. The terminal access grid is mainly divided manually on the traditional platform, and the terminal unified access fiber point (FAP) is set based on business needs and subjective experience. There is a lack of scientific and objective algorithms for evaluation, especially the density and distribution rationality of FAP settings. There is a lack of closed-loop evaluation, resulting in uneven resource distribution or repeated investment. When the service is opened, it relies on manual route design, with a low level of automation. It relies on manual processing of large amounts of data and information, which will lead to non-optimal route design due to human factors. There is a lack of evaluation and early warning of end-to-end resources, and timely resource reserves, which leads to the impact of resource investment on the opening efficiency when the service is opened.

[0038] Based on this, the embodiments of the present disclosure provide a network service management method, device, equipment, medium and program product, which can use the Thiessen polygon algorithm to evaluate the coverage density and layout rationality of the FAP in the terminal grid. By calculating the Thiessen polygons of each FAP box, the potential coverage range of the FAP in the terminal grid can be determined, and compared with the coverage range of other FAP boxes to evaluate the coverage density; the FAP is automatically selected through a three-point estimation algorithm, and the three-point estimation algorithm is used to predict the demand and coverage range of the FAP, which can provide decision support for the site selection and resource allocation of the FAP; the graph traversal algorithm can also be used to realize intelligent analysis of end-to-end resources and optimize the dynamic routing scheme of service access; and by setting the access optical path length, optical path hop count and fiber core resource rules, the algorithm is used to evaluate the resource utilization and compliance of each optical path, and the optical path resource situation from the potential FAP box to the aggregation room is evaluated to ensure the accessibility of the unified bearing point; and based on business needs, the optimal and suboptimal access optical path routing schemes can be automatically output. Combined with the FAP optical path information database and service access point location information, the FAP access point in the terminal grid is automatically selected, and a routing solution with the shortest distance and accessible optical path is generated.

[0039] It can be seen that the network service management method provided by the present disclosure solves the scientific planning of the unified FAP bearing point and the end-to-end resource intelligent analysis in the work of an optical cable network through the "end grid FAP coverage density evaluation method", "end-to-end resource reserve capacity evaluation method" and "FAP point selection and dynamic routing decision method" designed based on business logic and using known algorithms, filling the gap in the industry. Use Thiessen polygons and corresponding algorithm rules to evaluate the FAP coverage density and layout rationality in the end grid, and give supplementary suggestions to guide micro-planning; first combine practical experience to formulate access optical path length, optical path hop count and fiber core resource rules to achieve end-to-end optical path resource situation evaluation from potential FAP box to aggregation room, and ensure the accessibility of unified bearing points. The network service management method provided by the present disclosure can apply the Thiessen polygon algorithm to FAP coverage evaluation, and apply the three-point estimation and traversal algorithm to resource evaluation and routing decision-making, integrate these algorithms into the sandbox support system, and form a complete solution to achieve scientific planning of FAP in the optical cable network and intelligent analysis of end-to-end resources.

[0040] The technical solutions provided by various embodiments of the present disclosure are described in detail below in conjunction with the accompanying drawings.

[0041] Figure 1 The flowchart of a network service management method provided by the embodiment of the present disclosure is as follows. The method can be applied to a server, for example, a single server or a server cluster. Figure 1 As shown, the network service management method may include the following steps:

[0042] S101, based on the latitude and longitude layer of the terminal grid division, combined with the terminal grid data, the terminal grid is divided into different area types.

[0043] Among them, the terminal grid data includes at least one of the terminal grid information, optical cross-connection box information, ODB (On-Board Diagnostics) box information, the relationship between the terminal network and the optical cross-connection box, and the relationship between the terminal network and the ODB box; each area type corresponds to a FAP box coverage radius range.

[0044] In the embodiments of the present disclosure, when performing network service management, the latitude and longitude layer of the terminal grid can be used as the calculation basis. Input the terminal grid data, including the terminal grid information, the optical cross box / ODB box information, and the relationship between the terminal grid and the optical cross box / ODB box. Then, the terminal grid can be divided into different area types according to the geographical location and business characteristics. As an example, the area type can be set to six major categories, such as "dense urban area", "general urban area", "county town", "township", "rural area" and "others". For different area types, a FAP box coverage radius range is defined. For example, the FAP box coverage radius range of dense urban areas is less than 150m; the FAP box coverage radius range of general urban areas is less than 250m; the FAP box coverage radius range of suburban counties and developed towns is less than 300m; the FAP box coverage radius range of rural and mountainous areas is not limited, and the value of -1 represents no coverage radius limit. It can be understood that geographic information includes the boundaries of the terminal grid, the location of the FAP box, the optical cross-box information, and the relay section optical path resources, which can be collected, stored, analyzed and displayed through GIS (Geographic Information System). Based on the system's optical cross-box and ODB data, aggregation room information, optical cable relay section data, etc., Java-based data modeling can be used to develop an intelligent sandbox system, and network service management methods can be implemented based on the intelligent sandbox system.

[0045] S102, dividing the potential FAP box in the terminal grid by using the Thiessen polygon algorithm to obtain the potential coverage of each potential FAP box.

[0046] In the embodiments of the present disclosure, potential FAP boxes in the terminal grid can be determined. For example, PX (Patch Panel, wiring box) and FG (Fiber Optic Distribution Box) with uplink optical path resources can be selected as potential FAP boxes suitable for selection as FAP objects, and ODB boxes can also be selected as spare box resources for supplementary coverage. Then, the potential FAP boxes in the terminal grid can be divided by Voronoi Diagrams algorithm, and a Voronoi polygon is generated with each potential FAP box as the center, that is, there is a Voronoi polygon corresponding to each potential FAP box, and these Voronoi polygons cover the entire terminal grid area together, and each Voronoi polygon represents the potential coverage range of a corresponding potential FAP box.

[0047] S103, setting a FAP box in the terminal grid according to a potential coverage range corresponding to each potential FAP box and a set coverage range of each potential FAP box.

[0048] The coverage range is set based on the FAP box coverage radius range corresponding to each area type.

[0049] In an embodiment of the present disclosure, after obtaining the potential coverage range of each potential FAP box, the set coverage range of each potential FAP box can be determined based on the FAP box coverage radius range corresponding to the area type where the potential FAP box is located, with each potential FAP box as the center. Then, the FAP points that need to be set in the terminal grid can be determined based on the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box, and the FAP box can be set at the corresponding FAP point. It can be understood that the FAP box can be an optical handover box, such as a PX or FG with uplink optical path resources, and an ODB box can also be used as a FAP box. In this way, the terminal grid FAP coverage density assessment and the setting of the FAP box can be achieved.

[0050] S104, determining the optical path information from each FAP cabinet to the aggregation room according to the preset optical path rule through a graph traversal algorithm, and obtaining an optical path information set from the FAP cabinet to the aggregation room.

[0051] In an embodiment of the present disclosure, after the FAP cabinet is set, a light path information set from the FAP cabinet to the convergence room, that is, a light path information library, can be determined. Exemplarily, the light path information from the FAP cabinet to the convergence room can be realized by setting a preset light path rule and using a graph traversal algorithm, so that the light path information from each FAP cabinet to the convergence room can be obtained, and based on the light path information from each FAP cabinet to the convergence room, the light path information set from the FAP cabinet to the convergence room can be obtained, that is, the light path information library from the FAP cabinet to the convergence room.

[0052] S105 , selecting target optical path information from the optical path information set from the FAP cabinet to the aggregation room according to the service requirements of the access service.

[0053] In the embodiment of the present disclosure, after obtaining the optical path information set from the AP box to the convergence room, if an access service request is received, the service requirements of the access service, such as the location information of the access service, the access service type, etc., can be obtained to determine the target FAP point and the target convergence room. Then, according to the target FAP point and the target convergence room, the target optical path information can be selected from the optical path information set from the FAP box to the convergence room. The target optical path information can be one or more, and the target optical path information can be a routing solution with the shortest distance and the optical path reachable from the target FAP point to the target convergence room in the optical path information set from the FAP box to the convergence room.

[0054] In an embodiment of the present disclosure, the terminal grid is divided into different area types based on the latitude and longitude layer divided by the terminal grid and in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, optical cross-box information, ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each area type corresponds to a FAP box coverage radius range; the potential FAP boxes in the terminal grid are divided by the Thiessen polygon algorithm to obtain the potential coverage range of each potential FAP box; the FAP box is set in the terminal grid according to the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box; wherein the set coverage range is determined based on the FAP box coverage radius range corresponding to each area type; the optical path information from each FAP box to the convergence room is determined according to the preset optical path rule through the graph traversal algorithm, and the optical path information set from the FAP box to the convergence room is obtained; according to the service requirements of the access service, the target optical path information is selected from the optical path information set from the FAP box to the convergence room. In this way, the Thiessen polygon algorithm can be used to evaluate the coverage density and layout rationality of the FAP in the terminal grid. By calculating the Thiessen polygons of each FAP box, the potential coverage range of the FAP in the terminal grid can be determined, and the FAP box can be set in the terminal grid; the graph traversal algorithm can also be used to realize the intelligent analysis of end-to-end resources and optimize the dynamic routing scheme of service access; and based on the business needs of the access business, the better target optical path information can be automatically output to achieve the access optical path routing scheme. In this way, the Thiessen polygon algorithm and the traversal algorithm can be applied to the FAP point selection and routing decision, realizing the scientific planning of FAP points in the optical cable network and the intelligent analysis of end-to-end resources, thereby effectively improving the efficiency and accuracy of the network service management method.

[0055] In some possible implementations, the potential FAP boxes in the terminal grid are divided using a Thiessen polygon algorithm to obtain a potential coverage range of each potential FAP box, including:

[0056] Select the cabinet with uplink optical path resources in the terminal grid as the potential FAP cabinet;

[0057] Abstract each potential FAP box as an object point on the plane;

[0058] The Thiessen polygons corresponding to each potential FAP box are divided based on the object points corresponding to each potential FAP box through the Thiessen polygon algorithm; wherein the Thiessen polygons corresponding to each potential FAP box are used to indicate the potential coverage range of each potential FAP box.

[0059] In the disclosed embodiment, the potential FAP box in the terminal grid is divided by the Thiessen polygon algorithm to obtain the potential coverage of each potential FAP box. The box with the upper optical path resources in the terminal grid can be selected as the potential FAP box, for example, PX and FG with the upper optical path resources are selected as the potential FAP box suitable for selection as the FAP object, and the ODB box is listed as the spare box resource for supplementary coverage. Then, the potential FAP box object can be abstracted as all n object points in the grid plane in the same terminal access grid, and then the plane is divided based on the object points corresponding to each potential FAP box by the Thiessen polygon algorithm, so that any object point in the plane is closest to its nearest object point. The space around each object point forms a Thiessen polygon, which contains all points that are closer to the point than any other point, that is, the Thiessen polygon corresponding to each potential FAP box is obtained. These Thiessen polygons cover the entire grid area together, and each Thiessen polygon represents the potential coverage of a FAP box.

[0060] As an example, Voronoi Diagrams is a spatial analysis tool used to divide a plane according to a set of points (here, potential FAP boxes) so that any point in the plane is closest to its nearest point. The space around each point forms a Thiessen polygon, which contains all points that are closer to the point than any other point. Its implementation rules can be set in combination with the specific physical environment characteristics of the terminal grid and the FAP resource object, including: a. The latitude and longitude layer finely divided by the terminal grid is used as the calculation basis. Input the terminal grid information, optical intersection box / OBD box information, and the relationship between the terminal grid and the optical intersection box / OBD box. b. According to the geographical location and business characteristics, the terminal grid type is set to six major categories: "dense urban area", "general urban area", "county town", "township", "rural area" and "other", and the coverage radius of FAP is defined for different attributes: less than 150m in dense urban area; less than 250m in general urban area; less than 300m in suburban counties and developed towns; no limit in rural and mountainous areas, and the value of -1 represents no limit on the coverage radius. PX and FG with uplink optical path resources are selected as potential FAP cabinets suitable for selection as FAP objects, and ODB cabinets are listed as spare cabinet resources for supplementary coverage.

[0061] The algorithm can abstract the FAP boxes inside the terminal grid into points on the plane, and generate a Thiessen polygon with each FAP box as the center. For each point, the perpendicular bisector (i.e., perpendicular bisector) between it and other points is calculated. The closed area formed by the intersection of these perpendicular bisectors is the Thiessen polygon of the point. These Thiessen polygons cover the entire grid area together, and each Thiessen polygon represents the potential coverage of a FAP box. As a specific example, combined with Figure 2 , and its specific implementation process can be as follows: a. At the same end, access the inside of the grid, and abstract the potential FAP box objects suitable for FAP as all n object points in the grid plane; b. Select one point P1 as the reference point, and P1 as the starting point to connect the other n-1 points; c. For each line segment, make a perpendicular line in it, so that there are a total of n-1 perpendicular lines intersecting to form some polygons; d. The polygon surrounded by the perpendicular line closest to the reference point P1 is the Voronoi polygon of point P1, which does not include other reference points; e. Select other points as reference points in turn to find their Voronoi polygons.

[0062] In some possible implementations, according to the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box, the FAP box is set in the terminal grid, including:

[0063] Determine the coverage radius range of the set FAP box corresponding to the area type where each potential FAP box is located;

[0064] Calculate the set coverage range of each potential FAP box based on the set FAP box coverage radius range corresponding to each potential FAP box;

[0065] Determine the FAP coverage in the terminal grid according to the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box;

[0066] According to the FAP coverage in the terminal grid, a FAP box is set in the terminal grid.

[0067] In the embodiment of the present disclosure, according to the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box, when setting the FAP box in the terminal grid, the set FAP box coverage radius range corresponding to the area type where each potential FAP box is located can be determined first, and the set coverage range of each potential FAP box can be calculated based on the set FAP box coverage radius range. For example, the set coverage range of each potential FAP box is calculated with the FAP box as the center and the set coverage range of the potential FAP box as the radius. Then, the FAP coverage in the terminal grid can be determined based on the potential coverage range corresponding to each potential FAP box and the set coverage range of each potential FAP box. For example, the intersection area of ​​the set coverage range of each potential FAP box and the Thiessen polygon of each potential FAP box can be calculated, and the FAP coverage in the terminal grid can be determined by calculating the proportion of the intersection area in the set coverage range. After that, the FAP box can be set in the terminal grid according to the FAP coverage in the terminal grid.

[0068] As an example, the implementation process of this embodiment may include the following processing: f. In actual business, if the terminal mesh is a convex polygon, according to the Thiessen polygon generation algorithm, each FAP box point corresponds to a polygon that only contains the FAP box point, simulating the coverage of the FAP box point. However, if the terminal mesh is a concave polygon, for a FAP box, there may be multiple different Thiessen polygons corresponding (see Figure 3 , Figure 3 The black dot in the middle represents the FAP box point). From the business logic, the polygons that do not contain the FAP box point are defined, and the algorithm output is used as the area that needs to be covered by the additional box. Figure 3 , the Thiessen polygon in the lower left corner is the area where FAP coverage points need to be increased. g. For the case where there is no potential FAP box at all in the terminal grid, or there is only one FAP box but the FAP coverage range is limited, and the coverage area of ​​the terminal grid is less than the preset proportion (for example, 70%), you can consider looking for an ODB box as a substitute. h. For different attribute definitions of the terminal grid, the coverage radius of each potential FAP box can be obtained, and a circle is generated with the FAP box as the center. The intersection area of ​​the circle and the Voronoi polygon corresponding to the box is used to calculate the proportion of the intersection area relative to the Thiessen polygon, so as to evaluate whether the FAP needs to increase coverage. For each terminal grid, the definition of the FAP box coverage measurement result can be as follows: ① The optical handover box is selected as the FAP box to meet the coverage; ② The optical handover box in the Thiessen polygon area cannot meet the coverage, and an additional FAP box is required; ③ There is no optical handover box to choose from, and the ODB box is considered as the FAP box; ④ The optical handover box cannot meet the coverage, and the ODB box can be considered as the FAP box; ⑤ The optical handover box cannot meet the coverage, and there is no ODB box to choose from.

[0069] In some possible implementations, the optical path information from each FAP cabinet to the convergence room is determined according to the preset optical path rule by using a graph traversal algorithm, and an optical path information set from the FAP cabinet to the convergence room is obtained, including:

[0070] According to the area type of the terminal grid where the FAP cabinet is located, set the optical path length range from the FAP cabinet to the convergence room; each area type corresponds to an optical path length range;

[0071] Set the maximum allowed number of hops and fiber core resource rules for the optical path; the fiber core resource rules include that the number of idle fiber core resources in the entire optical path is greater than or equal to the preset number;

[0072] Determine the optical path length range, the maximum allowed number of optical path hops and the fiber core resource rule corresponding to each area type as the preset optical path rule;

[0073] For the relay segments between facility IDs and between facility IDs and aggregation site IDs, if the number of relay segments is less than 3, the average distance of the relay segments is taken as the relay segment length;

[0074] If the number of hops is greater than or equal to 3, the hop length is calculated using a three-point estimation algorithm;

[0075] According to the length of the relay segment, a node that meets the preset lightpath rules is selected as the aggregation site node through a graph traversal algorithm;

[0076] According to the aggregation site node, the optical path information from each FAP cabinet of each terminal grid to the aggregation room is generated to obtain the optical path information set from the FAP cabinet to the aggregation room.

[0077] In the disclosed embodiment, when the optical path information from each FAP cabinet to the convergence room is determined according to the preset optical path rules by using the graph traversal algorithm, and the optical path information set from the FAP cabinet to the convergence room is obtained, the optical path length range limit from the FAP cabinet to the convergence room can be set according to the area type of the terminal grid where the FAP cabinet is located. For example, it can be set to: the optical path length in dense urban areas ≤ 3000m; the optical path length in general urban areas ≤ 5000m; the optical path length in counties and towns ≤ 6000m; the optical path length in rural areas ≤ 12000m. The maximum allowed number of hops for the optical path is set, for example, it is set to 5 hops, 4 hops, 3 hops, etc., which is less than or equal to 5 hops. And, the fiber core resource rules are set, including that the number of idle fiber core resources in the entire optical path is greater than or equal to the preset number. For example, it can be set to at least one of the idle fiber core resources in the entire optical path ≥ 2 cores and the utilization rate of the optical path fiber core resources is less than or equal to the preset proportion. The preset proportion can be, for example, 70%. Then, the optical path length range, the maximum allowed number of optical path hops, and the fiber core resource rules corresponding to each area type can be determined as preset optical path rules. After that, the number of relay segments between the facility ID (Identity document, unique identifier) ​​and the facility ID, and the number of relay segments between the facility ID and the aggregation site ID can be determined. For the case where the number of relay segments is less than 3, the average value of the relay segments is directly taken as the estimated distance of the relay segments, that is, the length of the relay segments. For the case where the number of relay segments is greater than or equal to 3, the average value information of the relay segment length can be obtained through three-point estimation, and the fiber core and the remaining resource amount are accumulated. As an example, for the case where there are multiple relay segments between two IDs, the three-point estimation formula is used to combine and obtain the estimated distance, where the average distance is the average value obtained after removing the longest distance and the shortest distance. The calculation formula is as shown in formula (1). If the number of relay segments is less than 3, the average value is directly taken.

[0078] (Longest distance + shortest distance + 4*average distance) / 6 = hop length (1)

[0079] Afterwards, according to the length of the relay segment, a graph traversal algorithm, such as BFS (Breath First Search), can be used to select nodes that meet the preset optical path rules as aggregation site nodes (such as aggregation rooms). For example, a one-dimensional array can be used to record the possible path information from each FAP box to the aggregation room. Each element node of the one-dimensional array represents the end point of a relay segment. Each node needs to record the subscript of its parent node, the cumulative length of the relay segment, and the fiber core information of the current relay segment; when reaching a certain node, if it exceeds 5 hops, or the cumulative distance of the relay segment exceeds the maximum distance allowed by the end grid definition, the node is marked as the end search node; if the node belongs to the aggregation site and meets the requirement of no more than 5 hops and the length does not exceed the maximum distance allowed by the end grid, the node is marked as an aggregation site node, that is, an aggregation room. Then, according to the aggregation site node, the optical path information from each FAP box of each terminal grid to the aggregation room can be generated, and the possible path information from the FAP box to the aggregation room, that is, the optical path information, can be obtained. The possible path information is a set of optical path information from each FAP box of each terminal grid to the aggregation room. For example, according to the one-dimensional array obtained by the graph traversal algorithm, the site nodes can be retrieved from back to front, and according to each site node, the optical path information from each potential FAP box to the aggregation site can be generated in reverse order for each terminal grid.

[0080] In a possible implementation, after determining the optical path information from each FAP cabinet to the convergence room according to the preset optical path rule through the graph traversal algorithm and obtaining the optical path information set from the FAP cabinet to the convergence room, at least one of the following items is further included:

[0081] According to the optical path distance, fiber core resource status, and hop count data from each FAP box to the aggregation room, the data is normalized and weighted to obtain the optical path priority table corresponding to the terminal grid;

[0082] According to the optical path distance from each FAP cabinet to the convergence room, the fiber core resource situation, and whether the hop count data meets the preset optical path rules, a potential FAP optical path information library and an optical path warning information library to be optimized are obtained.

[0083] In the embodiment of the present disclosure, after obtaining the optical path information set from the FAP box to the convergence room, the optical path information set can also be processed to obtain an optical path priority table. Exemplarily, the data can be normalized and weighted (for example, the weight parameters can be adjusted through the final service test evaluation) according to the optical path distance, fiber core resource situation, and hop count data from each FAP box to the convergence room to obtain the optical path priority table corresponding to the terminal grid. The main function of the priority table is, for example, to provide optical path information with abundant resources and to provide construction suggestions for optical paths with tight resources. It is also possible to obtain a potential FAP optical path information library and an optical path warning information library to be optimized according to whether the optical path distance, fiber core resource situation, and hop count data from each FAP box to the convergence room meet the preset optical path rules. For example, the optical path information whose full optical path distance and hop count meet the set rules and whose full optical path idle fiber core resources are ≥2 cores can be included in the "potential FAP optical path information library", and the optical path information that does not meet the set rules or whose optical path fiber core resource utilization rate exceeds 70% can be included in the "optical path warning information library to be optimized".

[0084] In a possible implementation, target optical path information is selected from an optical path information set from a FAP cabinet to a convergence room according to a service requirement of an access service, including:

[0085] Calculate the terminal grid to which the service point of the access service belongs based on the location information of the access service;

[0086] Select FAP cabinet access points and aggregation rooms in the terminal grid according to the regional attributes of the terminal grid;

[0087] The target optical path information is selected from the optical path information set from the FAP cabinet to the aggregation room according to the FAP cabinet access point and the aggregation room.

[0088] In the disclosed embodiment, when receiving an access service, the target optical path information can be selected from the optical path information set from the FAP box to the convergence room according to the service requirements of the access service. Exemplarily, the FAP box access point selection and routing design based on the access service requirements can be used to select the target room according to the access service type (wireless, home broadband, customer collection), and the access optical path routing solution can be automatically output according to the potential FAP box optical path information (providing the best and suboptimal solutions for selection). As an example, the location information of the access service can be obtained, and the terminal grid to which the service point of the access service belongs can be calculated according to the location information of the access service, and the corresponding convergence room list can be screened from the service access area corresponding to the service point, and the FAP box access point can be automatically selected according to the service access point location information. Then, the target optical path information can be selected from the optical path information set from the FAP box to the convergence room according to the FAP box access point and the convergence room. For example, based on the "potential FAP optical path information library", that is, the optical path information set from the FAP cabinet to the aggregation room, a routing solution with the shortest distance and reachable optical path can be automatically generated as the target optical path information. The target optical path information can be one, two or more.

[0089] Furthermore, a loop check may be performed on the target optical path information. For example, it may be checked whether there are repeated jump points. If there are repeated jump points, the corresponding target optical path information may be deleted to avoid generating a loop.

[0090] It is understandable that the following processing can also be performed: according to the comprehensive sorting of the optical path information set from the FAP box to the aggregation room, the staff shall clarify the FAP box to be used according to the business rules. At the same time, the resource usage is synchronized to the resource library of the system, including registering the number of fiber cores to be reserved in the relay segment information of the pipeline system; for the data that has been occupied, it is synchronized to the box information and the resource information of the site. For the completion of supplementary construction, the completed FAP box data information and relay segment information are newly entered into the system, which triggers the calculation of the above method embodiment and updates the Thiessen polygon information of the grid. In addition, each time the FAP box selection, resource reservation, and resource occupation of a business are completed according to the business rules, the algorithm model of the above embodiment is activated accordingly, and the optical path information from the FAP box to the aggregation site in the terminal grid is recalculated for the latest situation of resource changes, and the priority sorting result of the FAP box corresponding to the terminal grid is recalculated. Update the result table data.

[0091] In order to make the network service management method provided by the embodiment of the present disclosure clearer, the following is explained with reference to specific examples. Figure 4The disclosed embodiment is mainly based on the optical cross-connection cabinet data, machine room information, optical cable relay segment data and locally defined terminal network layer data, etc., adopts Java architecture data modeling, and uses a variety of algorithmic technologies to achieve terminal grid FAP coverage density assessment, end-to-end resource reserve capacity assessment, FAP point selection based on business needs and automatic routing design functions. The three functional modules work together horizontally, and vertically run through the complete production process of planning and construction, optimized operation, and resource management.

[0092] The network service management method provided by the present disclosure mainly includes the following three parts:

[0093] 1. Implementation of terminal grid FAP coverage density assessment.

[0094] The technical principle of the terminal grid FAP coverage density assessment mainly focuses on the quantitative analysis of the layout rationality and coverage density of the FAP (unified access fiber point) in the terminal grid. This assessment process involves geographic information system (GIS) technology, spatial analysis methods, especially the concept and algorithm of Voronoi Diagrams. The relevant technical principles are as follows:

[0095] Geographic Information System (GIS) technology is a system used to collect, store, analyze and display geographic spatial data. In this scenario, GIS is used to manage and analyze geographic information related to the terminal grid, including the grid boundary, FAP location, optical cross-box information, and relay section optical path resources.

[0096] Voronoi Diagrams is a spatial analysis tool used to divide a plane according to a set of points (here, potential FAP boxes) so that any point in the plane is closest to its nearest point. The space around each point forms a Voronoi polygon, which contains all the points that are closer to that point than any other point.

[0097] (1) To implement the rules, the rules are first set based on the specific physical environment characteristics of the terminal grid and the FAP resource objects, as follows:

[0098] a. Use the longitude and latitude layer of the terminal grid as the calculation basis. Input the terminal grid information, optical intersection box / OBD box information, and the relationship between the terminal grid and the optical intersection box / OBD box.

[0099] b. According to the geographical location and business characteristics, the terminal grid type is set to six categories: "dense urban area", "general urban area", "county town", "township", "rural area" and "others", and the coverage radius of FAP is defined for different attributes: less than 150m in dense urban area; less than 250m in general urban area; less than 300m in suburban counties and developed townships; no limit in rural and mountainous areas, and the value of -1 represents no limit on the coverage radius.

[0100] c. Select PX and FG with uplink optical path resources as potential FAP cabinets suitable for selection as FAP objects, and list ODB cabinets as spare cabinet resources for supplementary coverage.

[0101] (2) Algorithm Design

[0102] The Thiessen polygon generation algorithm abstracts the FAP box inside the terminal grid as a point on the plane. A Thiessen polygon is generated with each FAP box as the center. For each point, the perpendicular bisector (i.e., the median) between it and other points is calculated. The closed area formed by the intersection of these medians is the Thiessen polygon of the point. These Thiessen polygons cover the entire grid area together, and each Thiessen polygon represents the potential coverage of a FAP box.

[0103] a. Access the inside of the grid at the same end, and abstract all n object points in the grid plane with a box object suitable for FAP;

[0104] b. Select one point P1 as the reference point, and use P1 as the starting point to connect the other n-1 points;

[0105] c. Draw a perpendicular line for each line segment, so that there are n-1 perpendicular lines intersecting to form some polygons;

[0106] d. The polygon enclosed by the perpendicular bisector closest to the reference point P1 is the Voronoi polygon of point P1, which does not include other reference points;

[0107] e. Select other points as reference points to find the Voronoi polygon. (ae algorithm process example is as follows Figure 2 shown).

[0108] f. In actual business, if the terminal grid is a convex polygon, according to the Thiessen polygon generation algorithm, each FAP box point corresponds to a polygon that only contains the FAP box point, simulating the coverage of the FAP box point. If the terminal grid is a concave polygon, for a FAP box, there will be multiple different Thiessen polygons (such as Figure 3As shown in the figure, the polygons that do not contain the FAP box points are defined from the business logic, except for the polygons that contain the FAP box points. The algorithm outputs the areas that need to be covered by additional boxes. Take the figure below as an example. The Thiessen polygon in the lower left corner is the area where the FAP coverage points need to be added.

[0109] g. In the case where there is no potential FAP box in the terminal grid, or there is only one FAP box but the FAP has a range limit and covers less than 70% of the terminal grid area, consider looking for an ODB box as a replacement.

[0110] h. For different attribute definitions of the terminal grid, the coverage radius of each potential FAP box can be obtained, and a circle is generated with the FAP box as the center. The intersection area of ​​the circle and the Voronoi polygons corresponding to the box is used to calculate the proportion of the intersection area relative to the Thiessen polygon, so as to evaluate whether the FAP needs to increase coverage. For each terminal grid, the definition of the FAP coverage measurement result is as follows:

[0111] ① The optical cross-connect box is selected as the FAP to meet the coverage requirements;

[0112] ② The optical cross-connect box in the Thiessen polygon area cannot meet the coverage requirements, and additional FAPs are required;

[0113] ③ No light handover box is optional, consider using ODB as FAP;

[0114] ④ If the optical cross-connect box cannot meet the coverage requirements, consider using ODB as FAP;

[0115] The optical cross-connect box cannot meet the coverage requirements and there is no ODB option.

[0116] 2. Implementation of end-to-end resource reserve capacity assessment

[0117] The technical principle of end-to-end resource reserve capacity assessment mainly revolves around the three-point estimation algorithm and graph traversal algorithm to realize the end-to-end optical path resource situation assessment from the potential FAP cabinet to the aggregation room. By setting the access optical path length, optical path hop count and fiber core resource rules, the potential FAP optical path information table that meets the access requirements and the optical path warning information table that needs to be optimized are output, thereby guiding the micro-planning team to carry out optical path routing design, end-to-end resource optimization and advance reserve planning for business access needs.

[0118] (1) Implementation rules

[0119] a. According to the terminal grid type where the FAP is located, set the end-to-end optical path length limit from the FAP to the aggregation site: the optical path length in dense urban areas is ≤3000m; the optical path length in general urban areas is ≤5000m; the optical path length in county towns and townships is ≤6000m; the optical path length in rural areas is ≤12000m;

[0120] b. Set the number of optical path hops ≤ 5;

[0121] c. If the distance and number of hops of the entire optical path meet the set rules and the idle fiber core resources of the entire optical path are ≥ 2 cores, they will be included in the "Potential FAP Optical Path Information Library". If they do not meet the set rules or the utilization rate of the optical path fiber core resources exceeds 70%, they will be included in the "Optical Path Warning / Hazard Library for Optimization".

[0122] (2) Algorithm design: Calculate based on the basic information of potential FAPs (basic information of optical cross-connect boxes and ODB boxes), relay segment information (recording the facility ID, length, number of fiber cores, and remaining resource information between adjacent jump points on the entire network link), and the relationship data between the grid and the optical cross-connect boxes and ODB boxes:

[0123] a. Based on the relay segment information: Generate the relationship information of the relay fiber segment between each facility ID and facility ID, and between the facility ID and the aggregation site ID, including the length, total number of fiber cores, used fiber cores, reserved fiber cores, and remaining fiber cores. During the algorithm calculation process, the data is converted and calculated as follows:

[0124] (1) A relay segment has only one record and no direction information. The algorithm calculation needs to consider the link direction. Therefore, each relay segment needs to be converted into two relay line segments with direction attributes. The two facility IDs are the starting point and end point of each other.

[0125] (2) For the relay segments between facility IDs and between facility IDs and aggregation site IDs, when there are multiple paths, the algorithm obtains the length mean information through three-point estimation, and the fiber core and remaining resource amounts are accumulated;

[0126] (3) Three-point estimation algorithm: When there are multiple relay segments between two IDs, the three-point estimation formula is used to combine and obtain the estimated distance, where the average distance is the average value obtained after removing the longest distance and the shortest distance. The formula is as follows:

[0127] (Longest distance + shortest distance + 4*average distance) / 6 = hop length

[0128] If the number of relay segments is less than 3, the average is taken directly.

[0129] b. According to the corresponding potential FAP information in the grid, calculate the route from each FAP to the aggregation room. Specifically, use step 1 to obtain the relay segment information, adopt the BFS breadth-first retrieval algorithm in the graph traversal algorithm, and use a one-dimensional array to record the possible path information from each FAP to the aggregation room. Each element node of the one-dimensional array represents the end point of a relay segment. Each node needs to record the subscript of its parent node, the cumulative length of the relay segment, and the fiber core information of the current relay segment. When reaching a certain node, if it exceeds 5 hops, or the cumulative distance of the relay segment exceeds the longest distance allowed by the grid definition, the node is marked as the end search node. If the node belongs to an aggregation site and meets the requirement of no more than 5 hops and the length does not exceed the longest distance allowed by the grid, the node is marked as an aggregation site node.

[0130] c. Based on the one-dimensional array obtained by the graph traversal algorithm in the previous step, retrieve the site nodes from the back to the front, and generate the optical path information of each grid and each potential FAP to the site in reverse order based on each site node.

[0131] d. In the grid, according to the optical path distance from FAP to the convergence room, fiber core resources, and hop count data, the data is normalized and weighted (the weight parameters need to be adjusted through the final business test evaluation) to obtain the optical path priority table corresponding to the grid. The main function of the priority table is to provide information on optical paths with abundant resources and to provide construction suggestions for optical paths with tight resources. And according to the full optical path distance, hop count that meets the set rules and the full optical path idle fiber core resources ≥ 2 cores, it is included in the "Potential FAP Optical Path Information Library", and those that do not meet the set rules or the optical path fiber core resource utilization rate exceeds 70% are included in the "Optical Path Warning Information Library to Be Optimized".

[0132] 3. Implementation of FAP site selection and dynamic routing decisions based on business needs, mainly realizing FAP access site selection and routing design based on access business needs, selecting the target computer room according to the access business type (wireless, home broadband, customer-facing), and automatically outputting the access optical path routing solution based on the potential FAP optical path information (providing the best and second-best solutions for selection).

[0133] (1) Implementation rules

[0134] a. According to the access service location information, first filter out the corresponding aggregation room list from the service access area corresponding to the service point; then filter out the target for access (the relevant equipment resources in the room are ready for production) according to the type of access service;

[0135] b. Automatically select the FAP access point within the terminal grid according to the service access point location information;

[0136] c. Automatically generate a routing solution with the shortest distance and accessible light path according to the "potential FAP light path information library";

[0137] d. Loop check: The output plan must be checked for repeated jump points. If there are any, they should be deleted to avoid output loops.

[0138] (2) Algorithm Design

[0139] a. Calculate the terminal grid to which the business point belongs based on the longitude and latitude selected by the business.

[0140] b. Define the FAP range according to the regional attributes of the grid itself, determine the available FAP information corresponding to the current service point, and the optical path information from the FAP to the aggregation site.

[0141] c. Based on the comprehensive sorting of the optical path information of the available FAPs, the business personnel, in accordance with the existing business rules, identify the FAP cabinets to be used, and synchronize the resource usage to the system's resource library, including the number of fiber cores reserved, which is registered in the relay segment information of the pipeline system. For data that is clearly occupied, it is synchronized to the cabinet information and the site's resource information.

[0142] d. For the completed supplementary construction, the data information of the completed FAP cabinet and the relay segment information are newly entered into the system, which will trigger the calculation of module one and update the Thiessen polygon information of the grid.

[0143] e. After completing the FAP selection, resource reservation, and resource occupation of a service according to the business rules, the algorithm model of module 2 is activated accordingly. According to the latest resource changes, the optical path resource update calculation from the FAP in the grid to the aggregation site is recalculated, and the FAP priority ranking result corresponding to the grid is recalculated. The result table data is updated.

[0144] As a specific example, each function can be implemented as follows:

[0145] 1. Implementation of terminal grid FAP coverage density assessment.

[0146] By collecting the usage data of each port resource and using the port resource thermal algorithm (the algorithm steps are as follows) to calculate the generated port resource heat map, the resource utilization rate can be intuitively seen. The color depth in the heat map represents the port utilization rate, which can intuitively show the resource usage. At the same time, through the application of the Voronoi diagram algorithm of this proposal, the area that needs to be supplemented with FAP boxes can be calculated and marked (as shown in the black arrow area in the figure below). By calculating the Thiessen polygons of each FAP box, its potential coverage range is determined, and compared with the coverage range of other FAP boxes to evaluate the coverage density, providing guidance and reference for planners.

[0147] The steps of the port resource thermal algorithm generation algorithm are as follows:

[0148] (1) Obtain the location and resource information of the spectrometer boxes in the park and user buildings;

[0149] (2) Calculate the actual business volume of the box by dividing the number of broadband addresses in use bound to the box by the total number of broadband addresses bound to the box;

[0150] (3) The map front end forms the grid heat in the area based on the actual business volume percentage;

[0151] (4) Based on the distribution of thermal values ​​in the region, the thermal region polygons in the region are found according to the well-known density algorithm such as Kmeans or DBScan (Density-Based Spatial Clustering of Applications with Noise);

[0152] (5) The intersection of the thermal area polygon and the FAP area polygon is calculated to obtain the location of the area where additional FAP convergence points are needed.

[0153] 2. End-to-end resource reserve capacity assessment and dynamic routing decision implementation.

[0154] As a specific example, in case 1, it is assumed that the customer manager has initiated an Internet dedicated line access service demand, longitude: 116.76783751, latitude: 23.48373617 (GPS), service activation type: PON (Passive Optical Network). After the longitude and latitude and activation type are input into the algorithm tool front-end interface, the terminal grid to which the service point belongs is located according to the longitude and latitude, the FAP range is specified according to the regional attributes of the grid itself, and the available FAP information corresponding to the current service point is determined. According to the corresponding potential FAP information in the grid, the BFS breadth-first search algorithm in the graph traversal algorithm is used. A one-dimensional array is used to record the possible path information from each FAP to the aggregation room, and the site nodes are retrieved from the back to the front. According to each site node, the optical path information from each grid and each potential FAP to the site is generated in reverse order, thereby outputting the alternative FAP and the alternative route corresponding to each FAP. According to the principle of short preferred route length and few hops, the first route is selected as the summary route for the service activation.

[0155] Case 2, assuming that the A aggregation room needs to be demolished, and the base station service "A1" under it needs to be cut over to other service aggregations. Longitude: 116.72556, Latitude: 23.39562 (GPS), Service cutover type: PTN (PTN). Routing information before cutover: xx District xx Building Room Wireless Room 01→Axxx1→Axxx2→A aggregation point x Building Room Transmission 1. The recommended FAP obtained through the end-to-end resource reserve capacity evaluation and dynamic routing decision function (the algorithm process of Case 1) is consistent with that before cutover. There is no need to change the access point. Only the last hop needs to be changed to the replacement station of the demolished room: B. Routing information after cutover: xx District xx Building Room Wireless Room 01→Axxx1→Axxx2→B aggregation room 01.

[0156] In summary, the disclosed embodiments solve the scientific planning of unified FAP bearing points and end-to-end resource intelligent analysis in the operation of an optical cable network through the "end grid FAP coverage density assessment method", "end-to-end resource reserve capacity assessment method", and "FAP point selection and dynamic routing decision method" designed based on business logic and using known algorithms, thus filling the gap in the industry. It is the first to use the Voronoi diagram and corresponding algorithm rules to evaluate the FAP coverage density and layout rationality in the end grid, and provide supplementary suggestions to guide micro-planning; it is the first to combine practical experience to formulate access optical path length, optical path hop count and fiber core resource rules to achieve end-to-end optical path resource situation assessment from potential FAP cabinets to aggregation rooms, and ensure the accessibility of unified bearing points. Specifically:

[0157] 1. Application of Voronoi diagram algorithm: Use Voronoi diagram to evaluate the coverage density and layout rationality of FAP (unified access fiber point) in the terminal grid. By calculating the Thiessen polygons of each FAP box, its potential coverage is determined, and compared with the coverage of other FAP boxes to evaluate the coverage density. 2. Application of three-point estimation algorithm: Automatically select FAP, and use the three-point estimation algorithm (most optimistic value, most likely value, and most pessimistic value) to predict the demand and coverage of FAP, thereby providing decision support for FAP site selection and resource allocation. 3. Application of graph traversal algorithm: Realize intelligent analysis of end-to-end resources and optimize dynamic routing solutions for service access. Use breadth-first search (BFS) to search for paths from potential FAP boxes to the aggregation room and evaluate the optical path resource situation. 4. End-to-end resource evaluation: Set the access optical path length, optical path hop count, and fiber core resource rules, and use the algorithm to evaluate the resource utilization and compliance of each optical path, evaluate the optical path resource situation from the potential FAP box to the aggregation room, and ensure the accessibility of the unified bearer point. 5. Dynamic routing decision: Based on business needs, automatically output the optimal and suboptimal access optical path routing solutions. Combined with the FAP optical path information library and the business access point location information, automatically select the FAP access point in the terminal grid and generate a routing solution with the shortest distance and accessible optical path.

[0158] The disclosed embodiments can integrate the above algorithm into the sandbox support system obtained by modeling to form a complete solution to achieve scientific planning of FAPs in optical cable networks and intelligent analysis of end-to-end resources, especially the application of Voronoi diagram algorithm in FAP coverage evaluation, and the use of three-point estimation and traversal algorithm in resource evaluation and routing decision-making.

[0159] The specific implementation and technical effects of each step of this embodiment are similar to those of the above method embodiments, and will not be repeated here.

[0160] Based on the same inventive concept, the embodiment of the present disclosure also provides a network service management device. Figure 5 As shown, the network service management device 500 includes:

[0161] The area division module 510 is used to divide the terminal grid into different area types based on the latitude and longitude layer of the terminal grid division and in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, the optical cross-box information, the ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each of the area types corresponds to a FAP box coverage radius range;

[0162] A polygon partitioning module 520 is used to perform Thiessen polygon partitioning on the potential FAP boxes in the terminal grid to obtain a potential coverage range of each potential FAP box;

[0163] The box setting module 530 is used to set the FAP box in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes; wherein the set coverage range is determined based on the FAP box coverage radius range corresponding to each of the area types;

[0164] The optical path module 540 is used to determine the optical path information from each FAP cabinet to the aggregation room according to the preset optical path rule through a graph traversal algorithm, and obtain the optical path information set from the FAP cabinet to the aggregation room;

[0165] The optical path selection module 550 is used to select target optical path information from the optical path information set from the FAP box to the aggregation room according to the service requirements of the access service.

[0166] In a possible implementation, the polygon division module 520 includes:

[0167] A selection unit, used to select a cabinet with an uplink optical path resource in the terminal grid as a potential FAP cabinet;

[0168] An abstraction unit, used to abstract each potential FAP box into an object point on a plane;

[0169] The polygon division unit is used to divide the object points corresponding to each potential FAP box by using the Thiessen polygon algorithm to obtain the Thiessen polygons corresponding to each potential FAP box; wherein the Thiessen polygons corresponding to each potential FAP box are used to indicate the potential coverage range of each potential FAP box.

[0170] In a possible implementation, the box setting module 530 is used to:

[0171] Determine a set FAP box coverage radius range corresponding to the area type where each potential FAP box is located;

[0172] Calculating a set coverage range of each potential FAP box based on a set FAP box coverage radius range corresponding to each potential FAP box;

[0173] Determine the FAP coverage in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes;

[0174] According to the FAP coverage in the terminal grid, a FAP box is arranged in the terminal grid.

[0175] In a possible implementation manner, the optical path module 540 is used to:

[0176] According to the area type of the terminal grid where the FAP cabinet is located, set the optical path length range from the FAP cabinet to the convergence room; each area type corresponds to an optical path length range;

[0177] Setting the maximum allowed number of hops and fiber core resource rules for the optical path; wherein the fiber core resource rules include that the number of idle fiber core resources in the entire optical path is greater than or equal to a preset number;

[0178] Determine the optical path length range corresponding to each area type, the maximum allowed number of hops of the optical path, and the fiber core resource rule as a preset optical path rule;

[0179] For the relay segments between facility IDs and between facility IDs and aggregation site IDs, if the number of relay segments is less than 3, the average distance of the relay segments is taken as the relay segment length;

[0180] If the number of hops is greater than or equal to 3, the hop length is calculated using a three-point estimation algorithm;

[0181] According to the relay segment length, a node satisfying the preset optical path rule is selected as a convergence site node through a graph traversal algorithm;

[0182] According to the aggregation site node, optical path information from each FAP cabinet of each terminal grid to the aggregation room is generated to obtain an optical path information set from the FAP cabinet to the aggregation room.

[0183] In a possible implementation manner, the network service management device 500 further includes at least one of the following:

[0184] A sorting module is used to normalize and weight the data according to the optical path distance from each FAP box to the convergence room, the fiber core resource situation, and the hop count data, so as to obtain an optical path priority sorting table corresponding to the terminal grid;

[0185] The optical path information library module is used to obtain a potential FAP optical path information library and an optical path warning information library to be optimized according to the optical path distance, fiber core resource status, and whether the hop count data from each FAP box to the convergence room meets the preset optical path rules.

[0186] In a possible implementation manner, the optical path selection module 550 is used to:

[0187] Calculating the terminal grid to which the service point of the access service belongs according to the location information of the access service;

[0188] Selecting a FAP cabinet access point and a convergence room in the terminal grid according to the regional attribute of the terminal grid;

[0189] According to the FAP cabinet access point and the aggregation room, target optical path information is selected from the optical path information set from the FAP cabinet to the aggregation room.

[0190] The specific implementation method and technical effect of the device provided in the embodiment of the present disclosure are similar to those of the above-mentioned method embodiment, and will not be repeated here.

[0191] According to an embodiment of the present disclosure, the present disclosure also discloses an electronic device, a computer-readable storage medium, and a computer program product.

[0192] Figure 6 A schematic block diagram of an example electronic device 600 that can be used to implement an embodiment of the present disclosure is shown. The electronic device 600 is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0193] like Figure 6 As shown, the electronic device 600 includes a computing unit 601, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 602 or a computer program loaded from a storage unit 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the device 600 can also be stored. The computing unit 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0194] Multiple components in the electronic device 600 are connected to the I / O interface 605, including: an input unit 606, such as a keyboard, a mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a disk, an optical disk, etc.; and a communication unit 609, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 609 allows the electronic device 600 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0195] The computing unit 601 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 601 performs the various methods and processes described above, such as the network service management method. For example, in some embodiments, the network service management method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 608. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 600 via the ROM 602 and / or the communication unit 609. When the computer program is loaded into the RAM 603 and executed by the computing unit 601, one or more steps of the network service management method described above may be performed. Alternatively, in other embodiments, the computing unit 601 may be configured to perform the network service management method in any other appropriate manner (e.g., by means of firmware).

[0196] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0197] The program code of the computer program product for implementing the method of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code can be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0198] In the context of the present disclosure, a computer-readable storage medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A computer-readable storage medium may be a machine-readable signal medium or a machine-readable storage medium. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or equipment, or any suitable combination of the foregoing. A more specific example of a computer-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0199] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0200] The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), the Internet, and a blockchain network.

[0201] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship between the client and the server is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services ("Virtual Private Server", or "VPS" for short). The server may also be a server of a distributed system, or a server combined with a blockchain.

[0202] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0203] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A network service management method, characterized in that: include: Based on the latitude and longitude layers of the terminal grid, the terminal grid is divided into different area types in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, optical cross-box information, ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each of the area types corresponds to a FAP box coverage radius range; Dividing the potential FAP box in the terminal grid by using the Thiessen polygon algorithm to obtain the potential coverage of each potential FAP box; According to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes, a FAP box is set in the terminal grid; wherein the set coverage range is determined based on the coverage radius range of the FAP box corresponding to each of the area types; Determine the optical path information from each FAP cabinet to the convergence room according to the preset optical path rule through a graph traversal algorithm, and obtain an optical path information set from the FAP cabinet to the convergence room; According to the service requirements of the access service, the target optical path information is selected from the optical path information set from the FAP cabinet to the aggregation room.

2. The network service management method according to claim 1, characterized in that: The performing of the Thiessen polygon algorithm to divide the potential FAP box in the terminal grid to obtain the potential coverage of each potential FAP box includes: Selecting a cabinet with uplink optical path resources in the terminal grid as a potential FAP cabinet; Abstract each potential FAP box as an object point on the plane; The Thiessen polygons corresponding to each potential FAP box are divided based on the object points corresponding to each potential FAP box through the Thiessen polygon algorithm; wherein the Thiessen polygons corresponding to each potential FAP box are used to indicate the potential coverage range of each potential FAP box.

3. The network service management method according to claim 2, characterized in that: The step of setting the FAP box in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes includes: Determine a set FAP box coverage radius range corresponding to the area type where each potential FAP box is located; Calculating a set coverage range of each potential FAP box based on a set FAP box coverage radius range corresponding to each potential FAP box; Determine the FAP coverage in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes; According to the FAP coverage in the terminal grid, a FAP box is arranged in the terminal grid.

4. The network service management method according to claim 1, characterized in that: The optical path information from each FAP cabinet to the convergence room is determined according to the preset optical path rule by the graph traversal algorithm, and the optical path information set from the FAP cabinet to the convergence room is obtained, including: According to the area type of the terminal grid where the FAP cabinet is located, set the optical path length range from the FAP cabinet to the convergence room; each area type corresponds to an optical path length range; Setting the maximum allowed number of hops and fiber core resource rules for the optical path; wherein the fiber core resource rules include that the number of idle fiber core resources in the entire optical path is greater than or equal to a preset number; Determine the optical path length range corresponding to each area type, the maximum allowed number of hops of the optical path, and the fiber core resource rule as a preset optical path rule; For the relay segments between facility IDs and between facility IDs and aggregation site IDs, if the number of relay segments is less than 3, the average distance of the relay segments is taken as the relay segment length; If the number of hops is greater than or equal to 3, the hop length is calculated using a three-point estimation algorithm; According to the relay segment length, a node satisfying the preset optical path rule is selected as a convergence site node through a graph traversal algorithm; According to the aggregation site node, optical path information from each FAP cabinet of each terminal grid to the aggregation room is generated to obtain an optical path information set from the FAP cabinet to the aggregation room.

5. The network service management method according to claim 4, characterized in that: After determining the optical path information from each FAP cabinet to the convergence room according to the preset optical path rule by using the graph traversal algorithm to obtain the optical path information set from the FAP cabinet to the convergence room, the method further includes at least one of the following: According to the optical path distance, fiber core resource status, and hop count data from each FAP box to the convergence room, the data is normalized and weighted to obtain an optical path priority table corresponding to the terminal grid; According to the optical path distance from each FAP cabinet to the convergence room, the fiber core resource situation, and whether the hop count data meets the preset optical path rules, a potential FAP optical path information library and an optical path warning information library to be optimized are obtained.

6. The network service management method according to claim 1, characterized in that: The selecting target optical path information from the optical path information set from the FAP box to the aggregation room according to the service requirements of the access service includes: Calculating the terminal grid to which the service point of the access service belongs according to the location information of the access service; Selecting a FAP cabinet access point and a convergence room in the terminal grid according to the regional attribute of the terminal grid; According to the FAP cabinet access point and the aggregation room, target optical path information is selected from the optical path information set from the FAP cabinet to the aggregation room.

7. A network service management device, characterized in that: include: A region division module is used to divide the terminal grid into different region types based on the latitude and longitude layers of the terminal grid division and in combination with the terminal grid data; wherein the terminal grid data includes at least one of the terminal grid information, the optical cross-box information, the ODB box information, the relationship between the terminal network and the optical cross-box, and the relationship between the terminal network and the ODB box; each of the region types corresponds to a FAP box coverage radius range; A polygon partitioning module, used for performing Thiessen polygon partitioning on the potential FAP box in the terminal grid to obtain a potential coverage range of each potential FAP box; A box setting module, used to set the FAP box in the terminal grid according to the potential coverage range corresponding to each of the potential FAP boxes and the set coverage range of each of the potential FAP boxes; wherein the set coverage range is determined based on the FAP box coverage radius range corresponding to each of the area types; An optical path module, used to determine the optical path information from each FAP cabinet to the convergence room according to a preset optical path rule through a graph traversal algorithm, and obtain an optical path information set from the FAP cabinet to the convergence room; The optical path selection module is used to select target optical path information from the optical path information set from the FAP box to the aggregation room according to the service requirements of the access service.

8. An electronic device, characterized in that: include: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement the network service management method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the network service management method according to any one of claims 1 to 6 is implemented.

10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the network service management method according to any one of claims 1 to 6 is implemented.

Images