Method and device for locating primary fiber splitting point, and electronic device

Abstract

The application provides a method and device for locating a primary fiber distribution point and an electronic device. The method comprises: determining the shortest construction distance from each candidate site of the primary fiber distribution point to a secondary fiber distribution point based on an improved Dijkstra algorithm with the constraint that the secondary fiber distribution point is allowed to pass through; selecting one of all the candidate sites that requires the least cable construction material to reach the secondary fiber distribution point as a target candidate site according to the shortest construction distance from each candidate site to the secondary fiber distribution point; and determining the actual location of the primary fiber distribution point in the region corresponding to the target candidate site. The application can intelligently determine a relatively appropriate location for the primary fiber distribution point.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a method and device for site selection of a primary distribution point and an electronic device. BACKGROUND

[0002] The primary distribution point is a physical node of an access layer, and is a connection point of a machine room and a secondary distribution point, responsible for access and forwarding of all services in a specific area, and is required to provide certain service cross and convergence capacity to make the communication network have good scalability.

[0003] At present, when the primary distribution point is selected, network planners mostly rely on the distribution of resources such as communication pipelines, pole lines and optical cables and services such as cells and buildings in the designated grid range, and combine personal experience to select the site. This site selection method lacks systematic scientific research and judgment, and is prone to unreasonable planning. SUMMARY

[0004] The present application aims to provide a method and device for site selection of a primary distribution point, which can automatically determine a relatively appropriate site selection position of the primary distribution point.

[0005] In order to achieve the above-mentioned purpose, the embodiments of the present application are implemented as follows:

[0006] In a first aspect, a method for site selection of a primary distribution point is provided, comprising:

[0007] Based on an improved Dijkstra algorithm, the shortest construction distance of each candidate point of the primary distribution point to the secondary distribution point allowed to pass through by routing is determined as a constraint;

[0008] According to the shortest construction distance of each candidate point to the secondary distribution point, one with the least optical cable construction material required to reach the secondary distribution point from all the candidate points is selected as a target candidate point;

[0009] The site selection of the primary distribution point in the region corresponding to the target candidate point is determined.

[0010] In a second aspect, a device for site selection of a primary distribution point is provided, comprising:

[0011] An algorithm module, based on an improved Dijkstra algorithm, determines the shortest construction distance of each candidate point of the primary distribution point to the secondary distribution point allowed to pass through by routing as a constraint;

[0012] A screening module selects one with the least optical cable construction material required to reach the secondary distribution point from all the candidate points as a target candidate point according to the shortest construction distance of each candidate point to the secondary distribution point.

[0013] a site selection module, configured to determine the site selection of the primary distribution point in a region corresponding to the target candidate site.

[0014] In a third aspect, an electronic device is provided, including: a processor; and a memory configured to store computer-executable instructions that, when executed, cause the processor to perform the method of the first aspect.

[0015] In a fourth aspect, a computer-readable storage medium is provided, configured to store computer-executable instructions that, when executed by a processor, implement the method of the first aspect.

[0016] The embodiments of the present application determine the shortest construction distance from each candidate site of the primary distribution point to the secondary distribution point based on the improved Dijkstra algorithm, with the constraint that the secondary distribution point is allowed to be passed through by the route. Then, the shortest construction distance from the candidate site to the secondary distribution point is taken as the dimension to evaluate all candidate sites, so as to select the target candidate site from all candidate sites according to the evaluation result. Further, the site selection of the primary distribution point is determined in the region corresponding to the target candidate site. The entire scheme can systematically and scientifically judge each candidate site of the primary distribution point, so as to find out the relatively appropriate shortest construction distance, so as to achieve the technical effects of reducing the communication signal transmission delay, reducing the optical cable construction materials, and improving the optical cable construction efficiency. Compared with the artificial site selection method, the probability of unreasonable planning is effectively reduced. BRIEF DESCRIPTION OF DRAWINGS

[0017] In order to more clearly illustrate the technical solutions of the embodiments of the present application or the prior art, the drawings needed in the embodiments or the prior art description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments described in the embodiments of the present application, and those skilled in the art can obtain other drawings according to these drawings without creating any creative labor.

[0018] Figure 1 The flowchart of the site selection method of the primary distribution point of the embodiments of the present application.

[0019] Figure 2 The structural diagram of the site selection device of the primary distribution point of the embodiments of the present application.

[0020] Figure 3 The structural diagram of the electronic device of the embodiments of the present application. DETAILED DESCRIPTION

[0021] The distribution point is a cable network node set on a cable route to realize fast and convenient access of customer services. The existing related technologies can be divided into two categories according to network positions and implementation functions: the first category is a primary distribution point on a backbone access cable route, which realizes cable distribution and scheduling; and the second category is a secondary distribution point on a distribution cable route, which mainly faces commercial buildings or residential buildings, and realizes various accesses such as customer collection, home loans, base stations, and room distribution. The primary distribution point mainly realizes the functions of cable scheduling and distribution, and the secondary distribution point mainly realizes the function of service access.

[0022] At present, when the primary distribution point is located, network planning personnel mostly rely on the distribution of resources such as communication pipelines, pole lines, and optical cables and services such as cells and buildings in the grid range, and the personal experience to locate. This locating method lacks systematic scientific research and judgment, and is prone to unreasonable planning problems.

[0023] Therefore, the present application aims to provide a technical solution for intelligently determining a suitable location of a primary distribution point.

[0024] In order for those skilled in the art to better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present specification, not all. Based on the embodiments in the present specification, all other embodiments obtained by those skilled in the art without creative labor should be within the scope of protection of the present specification.

[0025] One embodiment of the present application provides a locating method for a primary distribution point. Figure 1 is a flowchart of the locating method, which includes the following steps:

[0026] S102, based on an improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary distribution point to the secondary distribution point is determined with the secondary distribution points allowed to pass through as constraints.

[0027] In the present embodiment, the candidate point is an optical cable pole and pipe point, which is a construction position. The secondary distribution points allowed to pass through as constraints specifically refer to that the number of secondary distribution points does not exceed the upper limit of the number of routes supported.

[0028] The improved Dijkstra algorithm for determining the shortest construction distance will be described in detail below.

[0029] Specifically, in this embodiment, for each candidate point, multiple starting nodes and multiple vertex nodes are selected from multiple path nodes between each candidate point and the secondary fiber branching point, and a first set and a second set are initialized; wherein, the first set contains the determined starting nodes, the second set contains the determined vertex nodes, and the multiple vertex nodes include a target vertex node that represents the position of the secondary fiber branching point.

[0030] Next, for each of the candidate points, multiple iterations are performed to: calculate the distance from each starting node in the second set to all vertex nodes in the first set, and change the starting node with the smallest distance to a vertex node to migrate to the second set; wherein, the multiple iterations end after the number of rounds in which the target vertex node is added to the second set is completed;

[0031] Subsequently, for each of the candidate points, based on the engineering distance between each candidate point and each starting node after the multiple iterations, and the engineering distance between each starting node and the target vertex node, the shortest construction distance between each candidate point and the secondary fiber distribution point is determined.

[0032] It should be understood that the shorter the construction distance, the lower the communication signal transmission delay, the less material is needed for optical cable construction, and the higher the construction efficiency of optical cable.

[0033] S104. Using the shortest construction distance from the candidate point to the secondary fiber distribution point as the dimension, all candidate points are evaluated, and the target candidate point is selected from all candidate points based on the evaluation results.

[0034] In this embodiment, the shortest construction distance value can be selected from all candidate locations as the target candidate location, so as to reduce communication signal transmission delay, reduce the amount of materials used in optical cable construction, and improve the efficiency of optical cable construction as much as possible.

[0035] It should be noted that in practical applications, the shortest construction distance is not necessarily the only dimension for evaluating candidate sites. For example, the difficulty of construction caused by the terrain can also be used as a dimension to evaluate candidate sites. This article does not make specific limitations here.

[0036] S106, determine the actual location of the primary fiber distribution point in the area corresponding to the target candidate point.

[0037] In one possible implementation, the embodiment can obtain a grid map of a region corresponding to a target candidate site; then, evaluate each grid in the grid map in terms of disaster resistance and traffic convenience, so as to filter out a target grid from the grid map according to an evaluation result, and take a region corresponding to the target grid as a site for the primary distribution point. The number of optical cable cores required to be configured from the candidate site to the secondary distribution point is positively correlated with the number of users carried by the secondary distribution point.

[0038] On the basis described above, the effective grids of a constructible region (such as terrain grids of rivers, buildings, etc.) can be filtered out from the grid map first, and then the evaluation is performed only on the effective grids, so as to filter out the target grid.

[0039] In summary, the method of the embodiment can systematically and scientifically evaluate each candidate site of the primary distribution point, so as to find out a relatively suitable shortest construction distance, thereby achieving the technical effects of reducing communication signal transmission delay, reducing optical cable construction materials, and improving optical cable construction efficiency. Compared with the artificial site selection method, the probability of occurrence of unreasonable planning is effectively reduced.

[0040] The method of the embodiment is described in detail below.

[0041] The method of the embodiment mainly includes the following five steps:

[0042] Step one: taking the pole and tube points within the grid range as candidate sites of the primary distribution point, and using the improved Dijkstra algorithm to calculate the shortest total distance from a candidate site to each secondary distribution point under the routing constraint condition.

[0043] The specific process of the improved Dijkstra algorithm is as follows:

[0044] S1: set the starting point s, the target point d, the number of secondary distribution points n, and the number of secondary distribution points allowed to pass on the route N;

[0045] Initialization: the S set only contains the starting point s; the U set contains all other vertices except s, and the distance identifier of each vertex is "the distance from the starting point s to the vertex", and the not directly connected identifier is infinite. That is, S{} = s, U{} = other vertices.

[0046] S2: check the distance from all points in U to s, and select a point k with the minimum distance, that is: d sk = min[d sj ], and add the vertex k to the set S, and delete k from the set U.

[0047] S3: update the distance from the starting point s to all other vertices in the set U. The reason for the update is that in the previous step it has been determined that k is a vertex in the shortest path, and the path length from the previous vertex through vertex k to the next vertex can be smaller than the path length to the next vertex directly, so the shortest distance needs to be updated again to minimize the distance, that is: d sv = min[d sv , d sk + d kv ].

[0048] S4: determine whether the target point d exists in the set S, if not, continue to update steps (2) and (3), if yes, step 4 ends, and the distance and routing between the starting point s and the target point d are obtained.

[0049] S5: when n <= N, the path of each point is directly calculated by steps 1 to 4.

[0050] When n is greater than N, (1) the first N secondary distribution points, the distance from the starting point to each secondary distribution point is directly calculated by steps 1 to 4, and according to the routing summary of each point, it is determined whether there is a passage through the N secondary distribution points, if yes, the distance of the passage is modified to infinity, and the set S is emptied. (2) when calculating the remaining (n-N) points, after calculating the distance and routing from each secondary distribution point to the primary distribution point, it is determined whether there is a passage through the N secondary distribution points, if yes, the distance of the passage is modified to infinity, and the set S is emptied, and the calculation of the next point is performed. In the calculation process, if a point cannot find a route, the value of N needs to be adjusted accordingly.

[0051] Step two, according to the number of users covered by each secondary distribution point, configure different cable core numbers, such as 24 cores, 48 cores, etc.

[0052] Step three, according to the distance from the starting point to each secondary distribution point and the usage of the number of cable cores, the total cost of the cable construction under the condition that the starting point is a primary distribution point is obtained.

[0053] Step four, through the first step to the third step, the total cost of the cable construction when each candidate point in the region is a primary distribution point is calculated. According to the investment required by each point, the point with the least total cost is obtained as the best position.

[0054] The fifth step is to select the site around the best location and compare the conditions of the optional points. Condition 1: The site is safe and should be located in an area with low risk of natural disasters such as floods. Condition 2: The location is convenient for access, good first-level fiber distribution point access, and optical cable access. Considering the above two conditions, the best location is selected.

[0055] In addition, corresponding to Figure 1 The method shown, another embodiment of the present application also provides a site selection device for a first-level fiber distribution point. Figure 2 is a structural diagram of the site selection device 200, which includes:

[0056] The algorithm module 210 determines the shortest construction distance from each candidate point of the first-level fiber distribution point to the second-level fiber distribution point based on the improved Dijkstra algorithm with the constraint of the second-level fiber distribution point allowed by the route.

[0057] The screening module 220 evaluates all candidate points based on the shortest construction distance from the candidate points to the second-level fiber distribution points, and selects a target candidate point from all candidate points according to the evaluation results.

[0058] The site selection module 230 determines the site selection of the first-level fiber distribution point in the area corresponding to the target candidate point.

[0059] The device of the present embodiment determines the shortest construction distance from each candidate point of the first-level fiber distribution point to the second-level fiber distribution point based on the improved Dijkstra algorithm with the constraint of the second-level fiber distribution point allowed by the route. Then, all candidate points are evaluated based on the shortest construction distance from the candidate points to the second-level fiber distribution points, and a target candidate point is selected from all candidate points according to the evaluation results. Then, the site selection of the first-level fiber distribution point in the area corresponding to the target candidate point is determined. The whole scheme can systematically and scientifically judge each candidate point of the first-level fiber distribution point, so as to find the relatively appropriate shortest construction distance, so as to achieve the technical effects of reducing the communication signal transmission delay, reducing the optical cable construction materials, and improving the optical cable construction efficiency. Compared with the artificial site selection method, the probability of unreasonable planning is effectively reduced.

[0060] Optionally, the algorithm module 210 determines the shortest construction distance from each candidate site of the primary distribution point to the secondary distribution point based on an improved Dijkstra algorithm, including: for each candidate site, selecting a plurality of starting nodes and a plurality of vertex nodes from a plurality of path nodes between each candidate site and the secondary distribution point, and initializing a first set and a second set; wherein the first set contains the determined starting nodes, the second set contains the determined vertex nodes, and the plurality of vertex nodes contains a target vertex node representing the position of the secondary distribution point; for each candidate site, performing a plurality of iterations to execute: the distance from each starting node in the second set to all vertex nodes in the first set, and changing the starting node with the smallest distance to a vertex node to migrate to the second set; wherein the plurality of iterations ends after the number of rounds of adding the target vertex node to the second set is completed; for each candidate site, determining the shortest construction distance between each candidate site and the secondary distribution point based on the engineering distance between each candidate site and each starting node after the plurality of iterations, and the engineering distance between each starting node and the target vertex node.

[0061] Optionally, the screening module 220 evaluates all candidate sites based on the shortest construction distance from the candidate sites to the secondary distribution point, including: evaluating all candidate sites based on the shortest construction distance from the candidate sites to the secondary distribution point and the required number of cable cores.

[0062] Optionally, the required number of cable cores of the candidate sites to the secondary distribution point is positively correlated with the number of users carried by the secondary distribution point.

[0063] Optionally, the site selection module 230 determines the actual site selection of the primary distribution point in the region corresponding to the target candidate site, including: obtaining a grid map of the region corresponding to the target candidate site; evaluating each grid in the grid map based on disaster resistance and traffic convenience, thereby selecting a target grid from the grid map according to the evaluation result, and taking the corresponding region of the target grid as the actual site selection of the primary distribution point.

[0064] Optionally, the region corresponding to the target grid is a constructible region.

[0065] Optionally, the candidate site of the primary distribution point is a cable pole and pipe point.

[0066] It should be noted that the site selection device of the present embodiment can serve as the execution subject of the method shown in Figure 1 , and thus can realize the steps and functions in the method shown in Figure 1 .

[0067] Figure 3 is a structural schematic diagram of an electronic device provided by an embodiment of the present application. Please refer to Figure 3 At the hardware level, the electronic device comprises a processor, and optionally further comprises an internal bus, a network interface, and a memory. The memory can include a memory such as a random-access memory (RAM), and can further include a non-volatile memory such as at least one disk memory. Of course, the electronic device can further include other hardware required by a business.

[0068] The processor, the network interface, and the memory can be connected to each other through the internal bus, which can be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, and a control bus, etc. For ease of representation, Figure 3 Only one bidirectional arrow is used in the figure, but it does not mean that there is only one bus or only one type of bus.

[0069] The memory is used to store a program. Specifically, the program can include program code, and the program code includes computer operation instructions. The memory can include a memory and a non-volatile memory, and provides instructions and data to the processor.

[0070] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs, and at the logical level, forms the above-mentioned site selection device of the primary fiber distribution point. The processor executes the program stored in the memory, and is specifically used for executing the following operations:

[0071] Based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined as a constraint that the route is allowed to pass through.

[0072] The candidate points are evaluated in the dimension of the shortest construction distance from the candidate points to the secondary fiber distribution point, so as to screen out a target candidate point from all the candidate points according to the evaluation result.

[0073] The site selection of the primary fiber distribution point in the region corresponding to the target candidate point is determined.

[0074] The electronic device of the embodiment determines the shortest construction distance from each candidate site of the primary distribution point to the secondary distribution point based on the improved Dijkstra algorithm, taking the secondary distribution point passing through which the route allows as a constraint. Then, the shortest construction distance from the candidate site to the secondary distribution point is taken as a dimension to evaluate all candidate sites, so as to screen a target candidate site from all candidate sites according to the evaluation result; and then the site selection of the primary distribution point in the field is determined in the region corresponding to the target candidate site. The whole scheme can systematically and scientifically judge each candidate site of the primary distribution point, so as to find out the relatively appropriate shortest construction distance, so as to achieve the technical effects of reducing the communication signal transmission delay, reducing the optical cable construction materials, and improving the optical cable construction efficiency. Compared with the artificial site selection mode, the probability of occurrence of unreasonable planning is effectively reduced.

[0075] The method disclosed in the embodiments shown in the application Figure 1 above can be applied to a processor or implemented by the processor. The processor can be an integrated circuit chip with processing capability. In the implementation process, each step of the above method can be completed by integrated logic circuits or instructions in the form of software in the processor. The processor mentioned above can be a general processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. Each method, step and logic block disclosed in one or more embodiments of the application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in combination with one or more embodiments of the application can be directly embodied as a hardware code processor for execution, or a combination of hardware and software modules in the code processor for execution. The software module can be located in a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register or other mature storage medium in the art. The storage medium is located in the memory, and the processor reads the information in the memory and combines the hardware to complete the steps of the above method.

[0076] Of course, in addition to the software implementation, the electronic device of the present application does not exclude other implementation manners, such as a logic device or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and can also be hardware or a logic device.

[0077] The embodiment of the present application further provides a computer program product, which comprises a computer readable storage medium storing a computer program, and the computer program is operable to make a computer execute the following operations:

[0078] Based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined, with the secondary fiber distribution point as a constraint.

[0079] The candidate points are evaluated in the dimension of the shortest construction distance from the candidate points to the secondary fiber distribution point, so as to screen a target candidate point from all the candidate points according to the evaluation result.

[0080] The field site selection of the primary fiber distribution point is determined in the region corresponding to the target candidate point.

[0081] In summary, the above only describes the preferred embodiment of the present application, and is not used to limit the protection scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of one or more embodiments of the present application should be included in the protection scope of one or more embodiments of the present application.

[0082] The system, device, module or unit illustrated in the above embodiment can be specifically implemented by a computer chip or entity, or by a product with certain functions. A typical implementation device is a computer. Specifically, the computer may, for example, be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device or a combination of any of these devices.

[0083] Computer-readable media includes permanent and non-permanent, movable and non-movable media that can implement information storage by any method or technology. The information can be computer-readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassette, magnetic tape disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible by a computing device. According to the definition herein, computer-readable media does not include transitory media such as modulated data signals and carriers.

[0084] It should also be noted that the terms "comprising", "containing", or any other variant thereof are intended to cover non-exclusive inclusions, so that a process, method, article or apparatus that includes a list of elements does not only include those elements, but also includes other elements not explicitly listed, or inherent to such a process, method, article or apparatus. Without more limitations, the element defined by the statement "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0085] Each of the embodiments in the present application is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other. Each embodiment focuses on the difference from other embodiments. In particular, for the system embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the part of the method embodiments.

Claims

1. A method for selecting the location of a primary fiber splitting point, characterized in that, include: Using the secondary fiber distribution points that the route is allowed to pass through as constraints, and based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined; Using the shortest construction distance from the candidate point to the secondary fiber distribution point as the dimension, all candidate points are evaluated, and a target candidate point is selected from all candidate points based on the evaluation results. The actual location of the primary fiber distribution point is determined in the area corresponding to the target candidate point; Specifically, based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined, including: For each candidate point, multiple start-point nodes and multiple vertex nodes are selected from multiple path nodes between each candidate point and the secondary fiber branch point, and a first set and a second set are initialized; wherein, the first set contains the determined start-point nodes, the second set contains the determined vertex nodes, and the multiple vertex nodes contain a target vertex node representing the position of the secondary fiber branch point. For each of the candidate points, multiple iterations are performed to: calculate the distance from each starting node in the second set to all vertex nodes in the first set, and change the starting node with the smallest distance to a vertex node to migrate to the second set; wherein, the multiple iterations end after the number of rounds in which the target vertex node is added to the second set is completed; For each of the candidate points, based on the engineering distance between each candidate point and each starting node after multiple iterations, and the engineering distance between each starting node and the target vertex node, the shortest construction distance between each candidate point and the secondary fiber distribution point is determined.

2. The method according to claim 1, characterized in that, The shortest construction distance from the candidate location to the secondary fiber distribution point is used as the dimension to evaluate all candidate locations, including: The candidate locations are evaluated based on the shortest construction distance from the candidate locations to the secondary fiber distribution points and the required number of optical fiber cores.

3. The method according to claim 2, characterized in that, The number of optical fiber cores required to connect the candidate location to the secondary fiber distribution point is positively correlated with the number of users carried by the secondary fiber distribution point.

4. The method according to claim 1, characterized in that, Determining the actual location of the primary fiber distribution point within the area corresponding to the target candidate location includes: Obtain a grid map of the area corresponding to the target candidate point; Each grid in the grid map is evaluated based on disaster resilience and transportation convenience. Target grids are then selected from the grid map based on the evaluation results, and the corresponding areas of the target grids are used as the on-site locations for the primary fiber distribution points.

5. The method according to claim 4, characterized in that, The area corresponding to the target grid is the workable area.

6. The method according to any one of claims 1 to 5, characterized in that, The alternative locations for the primary fiber distribution points are optical cable poles and tubes.

7. A device for selecting the location of a primary fiber splitting point, characterized in that, include: The algorithm module, constrained by the secondary fiber distribution points that the route is allowed to pass through, determines the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point based on the improved Dijkstra algorithm. The screening module evaluates all the candidate points based on the shortest construction distance from the candidate point to the secondary fiber distribution point, and selects the target candidate point from all the candidate points according to the evaluation results. The site selection module determines the actual location of the primary fiber distribution point in the area corresponding to the target candidate point; The algorithm module, based on an improved Dijkstra algorithm, determines the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point, including: For each candidate point, multiple start-point nodes and multiple vertex nodes are selected from multiple path nodes between each candidate point and the secondary fiber branch point, and a first set and a second set are initialized; wherein, the first set contains the determined start-point nodes, the second set contains the determined vertex nodes, and the multiple vertex nodes contain a target vertex node representing the position of the secondary fiber branch point. For each of the candidate points, multiple iterations are performed to: calculate the distance from each starting node in the second set to all vertex nodes in the first set, and change the starting node with the smallest distance to a vertex node to migrate to the second set; wherein, the multiple iterations end after the number of rounds in which the target vertex node is added to the second set is completed; For each of the candidate points, based on the engineering distance between each candidate point and each starting node after multiple iterations, and the engineering distance between each starting node and the target vertex node, the shortest construction distance between each candidate point and the secondary fiber distribution point is determined.

8. An electronic device, comprising: processor; and memory configured to store computer-executable instructions, which, when executed, cause the processor to perform the following operations: Using the secondary fiber distribution points that the route is allowed to pass through as constraints, and based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined; Using the shortest construction distance from the candidate point to the secondary fiber distribution point as the dimension, all candidate points are evaluated, and a target candidate point is selected from all candidate points based on the evaluation results. The actual location of the primary fiber distribution point is determined in the area corresponding to the target candidate point; Specifically, based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined, including: For each candidate point, multiple start-point nodes and multiple vertex nodes are selected from multiple path nodes between each candidate point and the secondary fiber branch point, and a first set and a second set are initialized; wherein, the first set contains the determined start-point nodes, the second set contains the determined vertex nodes, and the multiple vertex nodes contain a target vertex node representing the position of the secondary fiber branch point. For each of the candidate points, multiple iterations are performed to: calculate the distance from each starting node in the second set to all vertex nodes in the first set, and change the starting node with the smallest distance to a vertex node to migrate to the second set; wherein, the multiple iterations end after the number of rounds in which the target vertex node is added to the second set is completed; For each of the candidate points, based on the engineering distance between each candidate point and each starting node after multiple iterations, and the engineering distance between each starting node and the target vertex node, the shortest construction distance between each candidate point and the secondary fiber distribution point is determined.

9. A computer program product comprising a computer-readable storage medium storing a computer program operable to cause a computer to perform the following operations: Using the secondary fiber distribution points that the route is allowed to pass through as constraints, and based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined; Using the shortest construction distance from the candidate point to the secondary fiber distribution point as the dimension, all candidate points are evaluated, and a target candidate point is selected from all candidate points based on the evaluation results. The actual location of the primary fiber distribution point is determined in the area corresponding to the target candidate point; Specifically, based on the improved Dijkstra algorithm, the shortest construction distance from each candidate point of the primary fiber distribution point to the secondary fiber distribution point is determined, including: For each candidate point, multiple start-point nodes and multiple vertex nodes are selected from multiple path nodes between each candidate point and the secondary fiber branch point, and a first set and a second set are initialized; wherein, the first set contains the determined start-point nodes, the second set contains the determined vertex nodes, and the multiple vertex nodes contain a target vertex node representing the position of the secondary fiber branch point. For each of the candidate points, multiple iterations are performed to: calculate the distance from each starting node in the second set to all vertex nodes in the first set, and change the starting node with the smallest distance to a vertex node to migrate to the second set; wherein, the multiple iterations end after the number of rounds in which the target vertex node is added to the second set is completed; For each of the candidate points, based on the engineering distance between each candidate point and each starting node after multiple iterations, and the engineering distance between each starting node and the target vertex node, the shortest construction distance between each candidate point and the secondary fiber distribution point is determined.

Images