Optical cable laying planning method and device, electronic equipment and storage medium
By automatically constructing optical cable laying planning strategies in geographic information system maps, the high cost problem caused by the complexity of optical cable networks has been solved, and the automation and efficiency improvement of optical cable laying planning have been achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- INSPUR TIANYUAN COMM INFORMATION SYST CO LTD
- Filing Date
- 2022-11-24
- Publication Date
- 2026-08-04
AI Technical Summary
Existing fiber optic cable laying plans mainly rely on manual methods, resulting in complex fiber optic cable networks and increased laying planning costs.
By identifying the fiber optic cable segments to be laid and the planning strategy in the geographic information system map, a set of fiber optic cable laying planning strategies is automatically constructed using line resource query and path calculation algorithms, reducing manual intervention.
It has automated the planning of optical cable laying, saving costs and improving efficiency.
Smart Images

Figure CN115935562B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of communication technology, and in particular to a method, apparatus, electronic device, and storage medium for optical cable laying planning. Background Technology
[0002] With the development of society and the economy, optical fiber and cable, as a new generation of transmission media, have brought significant improvements in security and network performance compared to copper media. This has led to continuous advancements in optical communication network technology, a gradual increase in the quantity of optical cable resources, and increasingly complex optical cable networks, resulting in a surge in services relying on optical cables. However, current optical cable laying planning methods primarily rely on manual methods, which, with the increasing complexity of optical cable networks, increases the cost of optical cable laying planning. Summary of the Invention
[0003] This invention provides a method, apparatus, electronic device, and storage medium for optical cable laying planning, aiming to save on the cost of optical cable laying planning.
[0004] In a first aspect, the present invention provides a method for planning the laying of optical cables, comprising:
[0005] Identify the fiber optic cable segments to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0006] Based on the demand information of the equipment at both ends of the optical cable segment to be laid, line resource queries are performed to obtain the bearer line resource dataset and point dataset.
[0007] Based on the maximum number of nodes via, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, path calculation is performed to output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0008] Based on the demand information of the equipment at both ends of the optical cable segment to be laid for the supporting facilities, a line resource query is performed to obtain a supporting line resource dataset and a point dataset, including:
[0009] If the requirement information indicates that neither of the devices at the two ends of the optical cable segment to be laid requires a carrier facility, then a line resource query is performed based on the devices at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0010] Based on the demand information of the equipment at both ends of the optical cable segment to be laid for the supporting facilities, a line resource query is performed to obtain a supporting line resource dataset and a point dataset, including:
[0011] If the requirement information indicates that the equipment at both ends of the optical cable segment to be laid requires carrier facilities, then a line resource query is performed based on the carrier facilities at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0012] Based on the demand information of the equipment at both ends of the optical cable segment to be laid for the supporting facilities, a line resource query is performed to obtain a supporting line resource dataset and a point dataset, including:
[0013] If the requirement information indicates that the equipment at one end of the optical cable segment to be laid requires a carrier facility, while the equipment at the other end does not require a carrier facility, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain the carrier line resource dataset and the point dataset.
[0014] The path calculation is performed based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, outputting a set of optical cable laying planning strategies for the optical cable segment to be laid, including:
[0015] The shortest path algorithm is used to calculate paths for the bearer line resource dataset and the point dataset to obtain multiple optical cable laying paths; the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of nodes passed through.
[0016] The dynamic programming algorithm is used to perform full path calculations on multiple optical cable laying paths, and outputs the optical cable laying planning strategy set; the number of optical cable laying paths in the optical cable laying planning strategy set does not exceed the maximum recommended number of strategies.
[0017] Each optical cable laying path is a path consisting of equipment or carrier facilities as the main path and carrier line resource data between equipment and / or carrier facilities as sub-paths; the number of the main path is one, and the number of the sub-paths is one or more.
[0018] After performing path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and outputting the optical cable laying planning strategy set for the optical cable segment to be laid, the method further includes:
[0019] A response policy display request is sent; the policy display request carries a policy number.
[0020] Based on the strategy number, obtain the optical cable laying planning strategy to be displayed from the optical cable laying planning strategy set;
[0021] The geographic data set of the target bearer line resource dataset in the optical cable laying planning strategy to be displayed is used to replace the geographic data of the optical cable segment to be laid, so that the geographic data set of the target bearer line resource dataset is displayed in the geographic information system map.
[0022] In a second aspect, the present invention provides an optical cable laying planning device, comprising:
[0023] The determination module is used to determine the optical cable segment to be laid in the geographic information system map, as well as to determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0024] The query module is used to query the line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities, and to obtain the carrying line resource dataset and the point dataset.
[0025] The strategy output module is used to perform path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0026] Thirdly, the present invention also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the optical cable laying planning method described in the first aspect.
[0027] Fourthly, the present invention also provides a non-transitory computer-readable storage medium, the non-transitory computer-readable storage medium comprising a computer program, which, when executed by the processor, implements the optical cable laying planning method of the first aspect.
[0028] Fifthly, the present invention also provides a computer program product, the computer program product comprising a computer program, which, when executed by the processor, implements the optical cable laying planning method of the first aspect.
[0029] The optical cable laying planning method, apparatus, electronic device, and storage medium provided by this invention determine the optical cable segment to be laid in a geographic information system map, and determine the maximum number of nodes to be traversed and the maximum number of recommended strategies for the planning strategy; perform line resource queries based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities to obtain a carrying line resource dataset and a point dataset; perform path calculation based on the maximum number of nodes to be traversed, the maximum number of recommended strategies, the carrying line resource dataset, and the point dataset, and output a set of optical cable laying planning strategies for the optical cable segment to be laid.
[0030] During the planning of optical cable laying, line resources are queried based on the demand information of the equipment at both ends of the optical cable section to be laid, and a set of line resource datasets and point datasets are obtained. Then, a set of optical cable laying planning strategies is automatically constructed based on the line resource datasets and point datasets, without the need for manual intervention, thereby saving the cost of optical cable laying planning. Attached Figure Description
[0031] To more clearly illustrate the technical solution of the present invention, the accompanying drawings used in the embodiments are described below. Obviously, the accompanying drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0032] Figure 1 This is a flowchart illustrating the optical cable laying planning method provided by the present invention;
[0033] Figure 2 This is a schematic diagram of an application scenario of the optical cable laying plan provided by the present invention;
[0034] Figure 3 This is a schematic diagram of the optical cable segment to be laid in the application scenario provided by the present invention;
[0035] Figure 4 This is one of the schematic diagrams of the optical cable laying planning strategy provided by the present invention;
[0036] Figure 5 This is the second schematic diagram of the optical cable laying planning strategy provided by the present invention;
[0037] Figure 6 This is the third schematic diagram of the optical cable laying planning strategy provided by the present invention;
[0038] Figure 7 This is the fourth schematic diagram of the optical cable laying planning strategy provided by the present invention;
[0039] Figure 8 This is a schematic diagram of the optical cable laying planning device provided by the present invention;
[0040] Figure 9 This is a schematic diagram of the structure of the electronic device provided by the present invention. Detailed Implementation
[0041] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this invention. All other embodiments obtained by those skilled in the art based on the embodiments of this invention without creative effort are within the scope of protection of this invention.
[0042] This invention provides an embodiment of an optical cable laying planning method. It should be noted that although the logical order is shown in the flowchart, under certain data conditions, the steps shown or described may be completed in a different order than that shown here.
[0043] Reference Figure 1 , Figure 1 This is a flowchart illustrating the optical cable laying planning method provided by the present invention. The optical cable laying planning method provided in this embodiment of the invention includes:
[0044] Step 101: Determine the optical cable segment to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0045] Step 102: Based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities, perform line resource query to obtain the carrying line resource dataset and point dataset;
[0046] Step 103: Calculate the path based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0047] It should be noted that the embodiments of the present invention use an optical cable laying planning system as an example. The optical cable laying planning method provided in the embodiments of the present invention is performed on a GIS (Geographic Information System) map.
[0048] Therefore, when a user needs to plan the laying of optical cables between certain sites on a GIS map, they first need to select the optical cable segments between those sites on the GIS map in the user interface of the optical cable laying planning system. Then, the user initiates the optical cable laying operation for these segments. Furthermore, the user also needs to input the maximum number of nodes the planning strategy will pass through, the maximum recommended number of nodes, and / or the maximum total length in the user interface.
[0049] It should be noted that the maximum number of transit nodes can be understood as the maximum number of line resource data carried in a planned path, and the maximum number of recommended strategies can be understood as the maximum number of planned paths. The maximum number of transit nodes and the maximum number of recommended strategies are required fields and are generally the system's default values, while the maximum total length is optional.
[0050] Furthermore, the user selects the optical cable segment to be laid on the GIS map in the user interface, enters the maximum number of nodes to pass through and the maximum recommended number of strategies, and then clicks the confirmation command.
[0051] Therefore, after the optical cable laying planning system detects the confirmation command, it determines the optical cable segment to be laid in the GIS map, the maximum number of nodes to be traversed in the planning strategy, and the maximum recommended number of strategies.
[0052] It should be further noted that the optical cable segment to be laid has two ends, one end is called optical cable A end, and the other end is called optical cable Z end.
[0053] Therefore, the optical cable laying planning system performs line resource queries based on the demand information for carrying facilities at end A of the optical cable, obtaining the carrying line resource dataset and point dataset for end A. Specifically, the system determines whether the equipment at end A of the optical cable requires carrying facilities, obtaining the determination result for end A. Further, based on the determination result for end A, the system determines whether to perform line resource queries at end A through equipment or carrying facilities, obtaining the carrying line resource dataset and point dataset for end A. Line resources include, but are not limited to, optical cable segments, cable segments, duct segments, pole segments, and riser segments; carrying line resources include, but are not limited to, duct segments, pole segments, riser segments, and wall-mounted segments.
[0054] Similarly, the optical cable laying planning system performs line resource queries based on the demand information of the optical cable Z-end for carrier facilities, obtaining the carrier line resource dataset and point dataset for the optical cable Z-end. Specifically, the optical cable laying planning system determines whether the equipment at the optical cable Z-end requires carrier facilities, obtaining the determination result for the optical cable Z-end. Further, based on the determination result for the optical cable Z-end, the optical cable laying planning system determines whether the optical cable Z-end should be queried through equipment or carrier facilities, obtaining the carrier line resource dataset and point dataset for the optical cable Z-end.
[0055] Therefore, the optical cable laying planning system obtains the bearer line resource dataset and point dataset of the optical cable segment to be laid based on the bearer line resource dataset and point dataset of the optical cable A end and the bearer line resource dataset and point dataset of the optical cable Z end.
[0056] Furthermore, the optical cable laying planning system performs path calculations based on the user-input maximum number of nodes and maximum number of recommended strategies, as well as the determined bearer resource dataset and point dataset of the optical cable segment to be laid, and outputs a set of optical cable laying planning strategies for the optical cable segment to be laid.
[0057] The optical cable laying planning method provided by this invention determines the optical cable segment to be laid in a geographic information system map, and determines the maximum number of nodes to be traversed and the maximum number of recommended strategies for the planning strategy; performs line resource query based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities, and obtains the carrying line resource dataset and the point dataset; performs path calculation based on the maximum number of nodes to be traversed, the maximum number of recommended strategies, the carrying line resource dataset and the point dataset, and outputs a set of optical cable laying planning strategies for the optical cable segment to be laid.
[0058] During the planning of optical cable laying, line resources are queried based on the demand information of the equipment at both ends of the optical cable section to be laid, and a set of line resource datasets and point datasets are obtained. Then, a set of optical cable laying planning strategies is automatically constructed based on the line resource datasets and point datasets, without the need for manual intervention, thereby saving the cost of optical cable laying planning.
[0059] Further, step 102 describes performing a line resource query based on the demand information of the equipment at both ends of the optical cable segment to be laid, to obtain a bearer line resource dataset and a point dataset, including:
[0060] It should be noted that the equipment requirements for the supporting facilities at both ends of the optical cable segment to be laid can be as follows: One end of the optical cable segment requires supporting facilities, while the other end does not; or neither end requires supporting facilities; or both ends require supporting facilities. A detailed analysis follows:
[0061] Therefore, for situations where both ends of the optical cable segment to be laid are equipped with devices:
[0062] If the requirement information indicates that neither of the devices at the two ends of the optical cable segment to be laid requires a carrier facility, then a line resource query is performed based on the devices at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0063] Specifically, if it is determined that neither end of the optical cable segment to be laid requires supporting facilities, the optical cable laying planning system continues to perform line resource queries using the equipment at both ends of the optical cable segment to be laid, obtaining a supporting line resource dataset and a point dataset. It should be noted that the starting point of the line resource query can be end A of the optical cable, and the ending point can be end Z of the optical cable. Alternatively, the starting point of the line resource query can be end Z of the optical cable, and the ending point can be end A of the optical cable. This embodiment of the invention uses end A of the optical cable and end Z of the optical cable as an example for illustration.
[0064] Therefore, the optical cable laying planning system performs line resource queries based on the equipment at end A of the optical cable, obtaining the bearer line resource dataset and point dataset for end A. Further, the system performs line resource queries based on the equipment at end Z of the optical cable, obtaining the bearer line resource dataset and point dataset for end Z. Further, the system iterates through the bearer line resource dataset and point dataset at end A, removing duplicate data from the bearer line resource dataset and point dataset at end Z, thus obtaining the bearer line resource dataset and point dataset for both ends of the optical cable segment to be laid. It should be noted that during the query process, if the number of bearer facilities searched exceeds the set maximum number of via nodes, the query stops.
[0065] If the requirement information indicates that the equipment at both ends of the optical cable segment to be laid requires carrier facilities, then a line resource query is performed based on the carrier facilities at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0066] Specifically, if it is determined that the equipment at both ends of the optical cable segment to be laid requires carrier facilities, the optical cable laying planning system queries the carrier facilities of the equipment at both ends, uses the carrier facilities to replace the equipment for line resource query, and obtains the carrier line resource dataset and point dataset.
[0067] Therefore, the optical cable laying planning system performs line resource queries based on the supporting facilities at end A of the optical cable, obtaining the supporting line resource dataset and point dataset for end A. Further, the system performs line resource queries based on the supporting facilities at end Z of the optical cable, obtaining the supporting line resource dataset and point dataset for end Z. Further, the system iterates through the supporting line resource dataset and point dataset at end A, removing duplicate data from the supporting line resource dataset and point dataset at end Z, thus obtaining the supporting line resource dataset and point dataset for both ends of the optical cable segment to be laid.
[0068] If the requirement information indicates that the equipment at one end of the optical cable segment to be laid requires a carrier facility, while the equipment at the other end does not require a carrier facility, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain the carrier line resource dataset and the point dataset.
[0069] Specifically, if it is determined that the equipment at one end of the optical cable segment to be laid requires a carrier facility, while the equipment at the other end does not, the optical cable laying planning system will use the carrier facility at one end and the equipment at the other end to perform line resource queries to obtain a carrier line resource dataset and a point dataset.
[0070] Taking an example where fiber optic cable A requires carrier facilities but Z does not, the fiber optic cable laying planning system performs a line resource query based on the carrier facilities at end A, obtaining the carrier line resource dataset and point dataset for end A. Further, the system performs a line resource query based on the equipment at end Z, obtaining the carrier line resource dataset and point dataset for end Z. Then, the system iterates through the carrier line resource dataset and point dataset at end A, removing duplicate data from the datasets at end Z, thus obtaining the carrier line resource dataset and point dataset for the fiber optic cable segment to be laid, showing the carrier facilities required at end A but not at end Z.
[0071] In this embodiment of the invention, the line resource query is performed based on whether the two ends of the optical cable segment to be laid are equipment or carrier facilities, and the carrier line resource dataset and point dataset are accurately retrieved.
[0072] Further, step 103 describes the path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, outputting a set of optical cable laying planning strategies for the optical cable segment to be laid, including:
[0073] The shortest path algorithm is used to calculate paths for the bearer line resource dataset and the point dataset to obtain multiple optical cable laying paths; the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of nodes passed through.
[0074] The dynamic programming algorithm is used to perform full path calculations on multiple optical cable laying paths, and outputs the optical cable laying planning strategy set; the number of optical cable laying paths in the optical cable laying planning strategy set does not exceed the maximum recommended number of strategies.
[0075] Specifically, the optical cable laying planning system performs path calculations on the bearer line resource dataset and point dataset based on the shortest path algorithm and dynamic programming algorithm, and outputs a set of optical cable laying planning strategies for the optical cable segment to be laid. The shortest path algorithm can be Dijkstra's algorithm, and the dynamic programming algorithm can be the Dynamic Programming (DP) algorithm, specifically:
[0076] The optical cable laying planning system uses Dijkstra's algorithm to calculate the path of the bearer line resource dataset and the point dataset, and calculates a shortest path, thus obtaining multiple optical cable laying paths. It should be noted that the shortest path is not necessarily the optimal path. A reasonable solution needs to be selected based on the specific scenario, and the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of passing nodes.
[0077] Furthermore, the optical cable laying planning system performs full path calculations on multiple optical cable laying paths using the DP algorithm. When the number of calculated paths reaches one less than the maximum recommended strategy number, the calculation stops and a set of optical cable laying planning strategies is output. In other words, the number of optical cable laying paths in the strategy set does not exceed the maximum recommended strategy number. It should be noted that each optical cable laying path in the strategy set can be considered equivalent to an optical cable laying planning strategy; therefore, each optical cable laying path has its corresponding strategy number.
[0078] Furthermore, the optical cable laying path consists of one or more bearer line resource data, either between equipment or bearer facilities, or between equipment and bearer facilities. Therefore, it can be understood that each optical cable laying path is a path consisting of equipment or bearer facilities as the main path and bearer line resource data between equipment and / or bearer facilities as sub-paths.
[0079] It should be noted that the equipment and / or carrier facilities points in the optical cable laying path determine the main path, which means that the set of points for the main path is different for each optical cable laying planning strategy.
[0080] Furthermore, one or more bearer line resource data between devices, or between bearer facilities, or between devices and bearer facilities, determine the sub-path. Therefore, different bearer line resource data between devices, or between bearer facilities, or between devices and bearer facilities serve as different sub-paths. Furthermore, each optical cable laying planning strategy consists of a main path and a set of multiple sub-paths, with each sub-path selecting one data point to form the main path.
[0081] This invention automatically constructs a set of optical cable laying planning strategies based on the bearer line resource dataset and the point dataset, without the need for manual intervention, thereby saving the cost of optical cable laying planning.
[0082] Further, after step 103 describes performing path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and outputting the optical cable laying planning strategy set for the optical cable segment to be laid, it also includes:
[0083] A response policy display request is sent; the policy display request carries a policy number.
[0084] Based on the strategy number, obtain the optical cable laying planning strategy to be displayed from the optical cable laying planning strategy set;
[0085] The geographic data set of the target bearer line resource dataset in the optical cable laying planning strategy to be displayed is used to replace the geographic data of the optical cable segment to be laid, so that the geographic data set of the target bearer line resource dataset is displayed in the geographic information system map.
[0086] It should be noted that after generating a set of optical cable laying planning strategies, the system will display them in the user interface. Users can then click on the desired strategy to display. After selecting the strategy, its main path will be displayed on the GIS map, and the sub-paths can be modified.
[0087] Specifically, the user clicks on the desired optical cable laying planning strategy in the user interface, and after clicking confirm, a strategy display request is sent to the optical cable laying planning system.
[0088] Furthermore, the optical cable laying planning system responds to the strategy display request and determines the strategy number carried in the strategy display request.
[0089] Furthermore, the optical cable laying planning system retrieves the optical cable laying planning strategy to be displayed from the optical cable laying planning strategy set according to the strategy number.
[0090] Furthermore, the optical cable laying planning system replaces the geographic data of the optical cable segment to be laid with the geographic data set of the target bearer line resource dataset in the optical cable laying planning strategy to be displayed, and displays the geographic data set of the target bearer line resource dataset in the geographic information system map, so that the direction of the optical cable segment to be laid is consistent with the direction of the bearer line resource data.
[0091] The embodiments of the present invention not only support optical cable laying path planning at the logical level, but also support the presentation of optical cable laying sections on GIS maps, thus saving human resources to a certain extent in planning optical cable laying.
[0092] Furthermore, multiple optical cable laying planning strategies are generated by manually selecting optical cables on the GIS map, and the optical cable laying planning strategies are presented on the GIS map. The selection of geographical location is added based on the consideration of logical parameters. Finally, the operator confirms the selected path and lays the optical cable, thereby saving the cost of optical cable laying planning.
[0093] In one embodiment, reference is made to Figure 2 , Figure 2This is a schematic diagram of an application scenario for the optical cable laying plan provided by the present invention. The supporting facilities include two sites, namely Site1 and Site2. There are four manholes, namely manholes MH1, MH2, MH3 and MH4. There are eight pipelines, namely Site1-MH1 (number 1), MH1-MH2 (number 2), MH2-Site2 (number 3), Site1-MH3 (number 4), MH3-Site2 (number 5), Site1-MH4 (number 6), and MH4-Site2 (number 7 / number 8).
[0094] A site is a location or area equipped with communication equipment and facilities that meets operational requirements. A hand well (MH) is a facility built by the communications department for equipment maintenance; a manhole allows people to enter, while a hand well only allows hands to be inserted.
[0095] Create a fiber optic cable segment between Site1 and Site2, designated as Fiber Optic Segment A. Figure 3 Taking the dashed line between Site 1 and Site 2 as an example, this scenario involves planning the laying of optical cables. Figure 3 This is a schematic diagram of the optical cable segment to be laid in the application scenario provided by the present invention.
[0096] Step 1: Select optical cable segment A to perform the optical cable laying action, and enter the maximum number of nodes to be passed and the maximum recommended number of schemes. The maximum number of nodes to be passed is 5 by default, and the maximum recommended number of schemes is 5 by default.
[0097] Step 2: Click "Query." Based on the equipment at any end of the selected optical cable segment A, query the supporting facilities for that equipment. Then, query the carrying line resource data based on the equipment or supporting facilities. The data query rules are as follows:
[0098] If the equipment at both ends of the optical cable segment to be laid does not require carrier facilities, then a line resource query is performed based on the equipment at both ends of the optical cable segment to be laid to obtain a carrier line resource dataset and a point dataset.
[0099] If both ends of the optical cable segment to be laid require carrier facilities, then a line resource query is performed based on the carrier facilities at both ends of the optical cable segment to be laid to obtain a carrier line resource dataset and a point dataset.
[0100] If the equipment at one end of the optical cable segment to be laid requires a carrier facility, while the equipment at the other end does not, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain a carrier line resource dataset and a point dataset.
[0101] Step 3: The optical cable laying planning system uses Dijkstra's algorithm and dynamic programming (DP) algorithm to optimize the queried bearer resource dataset and point dataset, as well as the input maximum number of via nodes and maximum number of recommended schemes. Finally, it outputs a set of optical cable laying planning strategies. The set of optical cable laying planning strategies includes optical cable laying planning strategy 1, optical cable laying planning strategy 2, and optical cable laying planning strategy 3.
[0102] Optical cable laying planning strategy 1 is: No. 4 -> No. 5, refer to Figure 4 , Figure 4 This is one of the schematic diagrams of the optical cable laying planning strategy provided by the present invention.
[0103] Optical cable laying planning strategy 2: No. 6 -> No. 7 / No. 8, refer to Figure 5 and Figure 6 , Figure 5 This is the second schematic diagram of the optical cable laying planning strategy provided by the present invention. Figure 6 This is the third schematic diagram of the optical cable laying planning strategy provided by the present invention.
[0104] Optical cable laying planning strategy 3: Number 1 -> Number 2 -> Number 3, refer to Figure 7 , Figure 7 This is the fourth schematic diagram of the optical cable laying planning strategy provided by the present invention.
[0105] When selecting fiber optic cable laying planning strategy 1 and fiber optic cable laying planning strategy 3, the set of all sub-paths is 1. Sub-paths do not need to be selected after selecting the main path.
[0106] If you select fiber optic cable laying planning strategy 2, then select the second sub-path, and then select sub-path 7, as shown below. Figure 5 show.
[0107] If you select optical cable laying planning strategy 2, then select the second sub-path, and then select sub-path 8, as shown below. Figure 6 show.
[0108] Furthermore, the optical cable laying planning device and the optical cable laying planning method provided by the present invention correspond to each other.
[0109] Figure 8 As shown, Figure 8 This is a schematic diagram of the optical cable laying planning device provided by the present invention. The optical cable laying planning device includes:
[0110] The determination module 801 is used to determine the optical cable segment to be laid in the geographic information system map, and to determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0111] The query module 802 is used to perform line resource query based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities, and obtain the carrying line resource dataset and the point dataset.
[0112] The strategy output module 803 is used to perform path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0113] Furthermore, the query module 802 is also used for:
[0114] If the requirement information indicates that neither of the devices at the two ends of the optical cable segment to be laid requires a carrier facility, then a line resource query is performed based on the devices at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0115] Furthermore, the query module 802 is also used for:
[0116] If the requirement information indicates that the equipment at both ends of the optical cable segment to be laid requires carrier facilities, then a line resource query is performed based on the carrier facilities at both ends of the optical cable segment to be laid to obtain the carrier line resource dataset and the point dataset.
[0117] Furthermore, the query module 802 is also used for:
[0118] If the requirement information indicates that the equipment at one end of the optical cable segment to be laid requires a carrier facility, while the equipment at the other end does not require a carrier facility, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain the carrier line resource dataset and the point dataset.
[0119] Furthermore, the strategy output module 803 is also used for:
[0120] The shortest path algorithm is used to calculate paths for the bearer line resource dataset and the point dataset to obtain multiple optical cable laying paths; the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of nodes passed through.
[0121] The dynamic programming algorithm is used to perform full path calculations on multiple optical cable laying paths, and outputs the optical cable laying planning strategy set; the number of optical cable laying paths in the optical cable laying planning strategy set does not exceed the maximum recommended number of strategies.
[0122] Furthermore, the optical cable laying planning device also includes a display module for:
[0123] A response policy display request is sent; the policy display request carries a policy number.
[0124] Based on the strategy number, obtain the optical cable laying planning strategy to be displayed from the optical cable laying planning strategy set;
[0125] The geographic data set of the target bearer line resource dataset in the optical cable laying planning strategy to be displayed is used to replace the geographic data of the optical cable segment to be laid, so that the geographic data set of the target bearer line resource dataset is displayed in the geographic information system map.
[0126] The specific embodiments of the optical cable laying planning device provided by the present invention are basically the same as the embodiments of the optical cable laying planning method described above, and will not be repeated here.
[0127] Figure 9 An example is a schematic diagram of the physical structure of an electronic device, such as... Figure 9 As shown, the electronic device may include: a processor 910, a communication interface 920, a memory 930, and a communication bus 940, wherein the processor 910, the communication interface 920, and the memory 930 communicate with each other through the communication bus 940. The processor 910 can call logical instructions in the memory 930 to execute an optical cable laying planning method, which includes:
[0128] Identify the fiber optic cable segments to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0129] Based on the demand information of the equipment at both ends of the optical cable segment to be laid, line resource queries are performed to obtain the bearer line resource dataset and point dataset.
[0130] Based on the maximum number of nodes via, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, path calculation is performed to output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0131] Furthermore, the logical instructions in the aforementioned memory 930 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0132] On the other hand, the present invention also provides a computer program product, comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program including program instructions, which, when executed by a computer, enable the computer to execute the optical cable laying planning method provided by the above methods, the method comprising:
[0133] Identify the fiber optic cable segments to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0134] Based on the demand information of the equipment at both ends of the optical cable segment to be laid, line resource queries are performed to obtain the bearer line resource dataset and point dataset.
[0135] Based on the maximum number of nodes via, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, path calculation is performed to output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0136] In another aspect, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, is implemented to perform the aforementioned optical cable laying planning methods, the method comprising:
[0137] Identify the fiber optic cable segments to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies.
[0138] Based on the demand information of the equipment at both ends of the optical cable segment to be laid, line resource queries are performed to obtain the bearer line resource dataset and point dataset.
[0139] Based on the maximum number of nodes via, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, path calculation is performed to output the optical cable laying planning strategy set for the optical cable segment to be laid.
[0140] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.
[0141] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.
[0142] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims
1. An optical cable installation planning method characterized by, include: Identify the fiber optic cable segments to be laid in the geographic information system map, and determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies. Based on the demand information of the equipment at both ends of the optical cable segment to be laid, line resource queries are performed to obtain the bearer line resource dataset and point dataset. The process of querying line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid, to obtain a line resource dataset and a point dataset, includes: Traverse the bearer resource dataset and point dataset at end A of the optical cable, remove duplicate data from the bearer resource dataset and point dataset at end Z of the optical cable that are duplicated with those at end A of the optical cable, and obtain the bearer resource dataset and point dataset of the equipment at both ends of the optical cable segment to be laid; during the query process, if the number of bearer facilities searched exceeds the maximum number of nodes passed through, stop the query. The process of querying line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid, to obtain a line resource dataset and a point dataset, includes: If the requirement information indicates that neither of the devices at the two ends of the optical cable segment to be laid requires a carrying facility, then a line resource query is performed based on the devices at both ends of the optical cable segment to be laid to obtain the carrying line resource dataset and the point dataset. If the requirement information indicates that the equipment at both ends of the optical cable segment to be laid needs to have carrying facilities, then a line resource query is performed based on the carrying facilities at both ends of the optical cable segment to be laid to obtain the carrying line resource dataset and the point dataset. If the requirement information is that the equipment at one end of the optical cable segment to be laid needs a carrier facility, and the equipment at the other end does not need a carrier facility, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain the carrier line resource dataset and the point dataset. Based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer line resource dataset, and the point dataset, path calculation is performed to output the optical cable laying planning strategy set for the optical cable segment to be laid. The path calculation is performed based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, outputting a set of optical cable laying planning strategies for the optical cable segment to be laid, including: The shortest path algorithm is used to calculate paths for the bearer line resource dataset and the point dataset to obtain multiple optical cable laying paths; the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of nodes passed through. The dynamic programming algorithm is used to perform full path calculations on multiple optical cable laying paths, and outputs the optical cable laying planning strategy set; the number of optical cable laying paths in the optical cable laying planning strategy set does not exceed the maximum recommended number of strategies.
2. The optical cable installation planning method of claim 1, wherein, Each optical cable laying path is a path consisting of equipment or carrier facilities as the main path and carrier line resource data between equipment and / or carrier facilities as sub-paths; the number of the main path is one, and the number of the sub-paths is one or more.
3. The optical cable laying planning method according to any one of claims 1 to 2, characterized in that, After performing path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, and outputting the optical cable laying planning strategy set for the optical cable segment to be laid, the method further includes: A response policy display request is sent; the policy display request carries a policy number. Based on the strategy number, obtain the optical cable laying planning strategy to be displayed from the optical cable laying planning strategy set; The geographic data set of the target bearer line resource dataset in the optical cable laying planning strategy to be displayed is used to replace the geographic data of the optical cable segment to be laid, so that the geographic data set of the target bearer line resource dataset is displayed in the geographic information system map.
4. A fiber optic cable laying planning device, characterized in that, include: The determination module is used to determine the optical cable segment to be laid in the geographic information system map, as well as to determine the maximum number of nodes through which the planning strategy passes and the maximum number of recommended strategies. The query module is used to query the line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid for the carrying facilities, and to obtain the carrying line resource dataset and the point dataset. The process of querying line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid, to obtain a line resource dataset and a point dataset, includes: Traverse the bearer resource dataset and point dataset at end A of the optical cable, remove duplicate data from the bearer resource dataset and point dataset at end Z of the optical cable that are duplicated with those at end A of the optical cable, and obtain the bearer resource dataset and point dataset of the equipment at both ends of the optical cable segment to be laid; during the query process, if the number of bearer facilities searched exceeds the maximum number of nodes passed through, stop the query. The process of querying line resources based on the demand information of the equipment at both ends of the optical cable segment to be laid, to obtain a line resource dataset and a point dataset, includes: If the requirement information indicates that neither of the devices at the two ends of the optical cable segment to be laid requires a carrying facility, then a line resource query is performed based on the devices at both ends of the optical cable segment to be laid to obtain the carrying line resource dataset and the point dataset. If the requirement information indicates that the equipment at both ends of the optical cable segment to be laid needs to have carrying facilities, then a line resource query is performed based on the carrying facilities at both ends of the optical cable segment to be laid to obtain the carrying line resource dataset and the point dataset. If the requirement information is that the equipment at one end of the optical cable segment to be laid needs a carrier facility, and the equipment at the other end does not need a carrier facility, then a line resource query is performed based on the carrier facility at one end and the equipment at the other end to obtain the carrier line resource dataset and the point dataset. The strategy output module is used to perform path calculation based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer line resource dataset, and the point dataset, and output the optical cable laying planning strategy set for the optical cable segment to be laid. The path calculation is performed based on the maximum number of via nodes, the maximum number of recommended strategies, the bearer resource dataset, and the point dataset, outputting a set of optical cable laying planning strategies for the optical cable segment to be laid, including: The shortest path algorithm is used to calculate paths for the bearer line resource dataset and the point dataset to obtain multiple optical cable laying paths; the number of bearer line resource data in each optical cable laying path does not exceed the maximum number of nodes passed through. The dynamic programming algorithm is used to perform full path calculations on multiple optical cable laying paths, and outputs the optical cable laying planning strategy set; the number of optical cable laying paths in the optical cable laying planning strategy set does not exceed the maximum recommended number of strategies.
5. An electronic device, the electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the optical cable laying planning method according to any one of claims 1 to 3.
6. A non-transitory computer-readable storage medium, the non-transitory computer-readable storage medium comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the optical cable laying planning method according to any one of claims 1 to 3.