Apparatus, method and program for designing loop wiring

Abstract

The purpose of the present disclosure is to enable mechanical selection of a loop route, which is highly cost-effective with respect to the number of demands under the jurisdiction, from map information and facility information without depending on a designer of an access network.　In order to achieve the abovementioned purpose, a device for designing loop wiring according to the present disclosure: generates, by using inputted facility information and map information, loops in which optical fibers on a map are connected in a loop shape; deletes, among the generated loops, at least some of overlapping loops in which loop areas surrounded with loops on the map overlap to a certain extent or more, to thereby cancel the overlapping loops; if there is a number-of-demand out-of-range loop, in which an estimated number of demands to be generated inside / outside of loops falls out of a range of the number of demands optionally set, in a loop group of loops having the overlapping cancelled, deletes the number-of-demand out-of-range loop; repeats again cancelling of the overlapping loops; and designs a loop group composed of only loops, in which the number of demands falls within the range of the number of demands, as a selected loop group.

Description

[Technical field]

[0001] The present disclosure relates to an apparatus, a method, and a program for designing loop wiring in an optical access network. [Background technology]

[0002] Next-generation communication services require access networks that are highly reliable and can flexibly respond to fluctuations in demand. As an access wiring method that meets this requirement, a multistage loop type optical access network is being studied (for example, see Non-Patent Document 1). [Prior art documents] [Non-patent literature]

[0003] [Non-Patent Document 1] Makisato Ohno et al., “Optical Access Network Configuration Method to Support a Resilient Society,” 2021 Shinshu-Soviet University, BK-2-2, 2021 Summary of the Invention [Problem to be solved by the invention]

[0004] However, in the design of this multi-stage loop type optical access network, there is no established index to evaluate the loop shape from the viewpoint of whether it is highly cost-effective in terms of installation costs while efficiently covering the generated demand. Therefore, in order to design a loop that meets the required performance at low cost, it is necessary to check and evaluate the presence or absence of communication infrastructure facilities, their usage status, and the expected number of demands one by one, and manual calculations and design by someone with access network design skills are indispensable. This manual design causes issues such as the cost of securing the operation of people with design skills and the design quality of the required cable length, etc., which differs from designer to designer.

[0005] In order to solve the above problems, the present disclosure aims to provide a loop wiring design device, method, and program that makes it possible to mechanically select a loop route that has high cost-effectiveness relative to the demand volume from map information and facility information, without relying on the knowledge of an individual with access network design skills. [Means for solving the problem]

[0006] In order to achieve the above objective, the present disclosure eliminates loops with overlapping loop areas that have low cost-effectiveness relative to the number of managed demands, and selects loops so that the expected number of managed demands falls within an arbitrarily set range of demands.

[0007] Specifically, the loop wiring design device according to the present disclosure includes: A loop wiring design device for an optical access network that is laid on a loop-shaped route passing through a telecommunications carrier base facility, comprising: an input unit for inputting facility information including facility information on points at which optical fibers can be connected to each other and connection route information indicating routes connected by optical fibers, and map information indicating the position on a map of each facility included in the facility information; Using the facility information and the map information, a loop is created by connecting optical fibers in a loop shape on the map; If there are overlapping loops among the initial loop group composed of the created loops, the loop areas enclosed by the loops on the map overlapping each other by a certain amount or more, at least some of the overlapping loops are deleted to eliminate the overlapping loops; If there is a loop out of the demand number range among the loop group after the elimination of the overlapping loops, in which the sum of the expected demand number occurring inside the loop and the expected demand number occurring outside the loop at an arbitrary distance from the loop, which are calculated based on the predetermined demand number for each location, is outside an arbitrarily set demand number range, the loop out of the demand number range is deleted from the loop group before the elimination of the overlapping loops, and the overlapping loop is eliminated again for the loop group after the loop out of the demand number range is deleted, so that the sum of all of the loops in the loop group after the elimination of the overlapping loops falls within the demand number range, A calculation unit that designs, as a selected loop group, a loop group that is composed of only loops whose total falls within the demand quantity range; Equipped with.

[0008] Specifically, the loop wiring design method according to the present disclosure includes: A loop wiring design method for an optical access network to be laid on a loop-shaped route passing through a telecommunications carrier base facility, comprising the steps of: inputting facility information including information on facilities at which optical fibers can be connected to each other and connection route information indicating routes connected by optical fibers, and map information indicating the positions on a map of each facility included in the facility information; Using the facility information and the map information, a loop is created by connecting optical fibers in a loop shape on the map; If there are overlapping loops among the initial loop group composed of the created loops, the loop areas enclosed by the loops on the map overlapping each other by a certain amount or more, at least some of the overlapping loops are deleted to eliminate the overlapping loops; If there is a loop out of the demand number range among the loop group after the elimination of the overlapping loops, in which the sum of the expected demand number occurring inside the loop and the expected demand number occurring outside the loop at an arbitrary distance from the loop, which are calculated based on the predetermined demand number for each location, is outside an arbitrarily set demand number range, the loop out of the demand number range is deleted from the loop group before the elimination of the overlapping loops, and the overlapping loop is eliminated again for the loop group after the loop out of the demand number range is deleted, so that the sum of all of the loops in the loop group after the elimination of the overlapping loops falls within the demand number range, A loop group consisting of only loops whose total falls within the demand number range is designed as a selected loop group.

[0009] Specifically, the program according to the present disclosure is a program for causing a computer to function as the loop wiring design device. Effect of the Invention

[0010] According to the present disclosure, it is possible to provide a loop wiring design device, method, and program that makes it possible to mechanically select a loop route that has high cost-effectiveness relative to the demand volume from map information and facility information, without relying on the knowledge of a skilled access network designer. [Brief description of the drawings]

[0011] [Figure 1] 1A to 1C are diagrams illustrating an example of a method for designing a loop wiring according to an embodiment. [Diagram 2] FIG. 11 is a diagram illustrating a loop setting according to an embodiment. [Diagram 3] FIG. 10 is a diagram illustrating point equipment that is a target of loop setting according to the embodiment. [Figure 4] FIG. 1 is a diagram illustrating an example of a multistage loop type optical access network according to an embodiment. [Diagram 5] 11A and 11B are diagrams illustrating the removal of cross loops according to an embodiment. [Figure 6] 11A and 11B are diagrams illustrating the deletion of loops having overlapping areas according to the embodiment. [Figure 7] FIG. 13 is a diagram illustrating a list according to the embodiment. [Figure 8] 11A to 11C are diagrams illustrating the deletion of a loop based on a desired loop area according to an embodiment. [Figure 9] 1 is a diagram for explaining loop creation in a multistage loop type optical access network according to an embodiment; [Figure 10] 1 is a diagram for explaining loop creation in a multistage loop type optical access network according to an embodiment; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] Hereinafter, the embodiments of the present disclosure will be described in detail with reference to the drawings. Note that the present disclosure is not limited to the embodiments shown below. These implementation examples are merely illustrative, and the present disclosure can be implemented in various forms with various modifications and improvements based on the knowledge of those skilled in the art. Note that components with the same reference numerals in this specification and drawings are assumed to indicate the same components.

[0013] (Embodiment) A method for designing a multistage loop type optical access network performed by the loop wiring design device will be described with reference to Fig. 1. First, map information and facility information are input (step S000). The map information may include information on the expected demand for each region or location, and information on whether optical fiber can be laid in each region or location. The facility information may include point facility information including the type of point facility such as a communication base station, manhole, utility pole, the location of the point facility, and the usage status of the point facility, as well as connection route information between the point facilities. Examples of the location of the point facility include the longitude and latitude of the point facility.

[0014] Based on the input map information and facility information, a loop in which optical fibers can be connected in a loop is set on the map so that the expected number of demands within the loop and within 700 m of the loop periphery is 100 to 300 (step S100).

[0015] The area covered by each loop is set as a wiring section on the map (step S200). For example, the area within 700 m around the loop may be set as the wiring section on the map. Note that, for overlapping wiring sections between loops, it may be arbitrarily selected which loop the wiring section belongs to.

[0016] A loop originating from a communication base station and a loop originating from a manhole directly connected to a tunnel are set as upper loops (step S300). Depending on the equipment situation, a loop originating from a utility pole may be set as an upper loop. Loops other than the upper loop are set as lower loops, and grouping is performed so that 0 to 4 lower loops are connected to one upper loop (step S300). If there are five or more lower loops, grouping of the upper loops and lower loops is performed again so that there are 0 to 4 lower loops. If the access network is not a multi-stage loop type consisting of an upper loop and a lower loop, step S300 does not need to be performed.

[0017] An example of a multistage loop type optical access network having upper loops and lower loops is shown in Figure 4. The optical access network in Figure 4 is composed of upper loops UL1 to UL4 and lower loops LL1 to LL12. LL1 to LL3 are connected to UL1, LL4 to LL6 to UL2, LL7 to LL9 to UL3, and LL10 to LL12 to UL4. In this case, three lower loops are connected to each of the upper loops UL1 to UL4, so there is no problem with grouping.

[0018] If other loop shapes can be selected within the wiring section, the loop shape is considered based on the criterion that the area enclosed by the loop should be about 40% of the wiring section area (step S400), while keeping the length of the distribution cable as short as possible.

[0019] The number of cores required in the upper loop is calculated using formula (1), and the number of cores required in the lower loop is calculated using formula (2) (step S500). (Number 1) (Estimated demand for own loop + spare cores) ÷ 2 + Number of cores in the lower loop cable to be connected (1) (Number 2) (Estimated demand for own loop + spare core wire) ÷ 2 (2) At this time, cable integration of overlapping route sections is considered based on facility information, taking into account economic efficiency and the availability of infrastructure facilities. If the access network is not a multi-stage loop type consisting of upper and lower loops, the required number of fibers for each loop may be calculated using formula (2).

[0020] In step S100 of the conventional method, there was no index for evaluating the loop shape from the viewpoint of whether it was cost-effective in terms of installation costs while efficiently covering the generated demand.

[0021] This disclosure provides such an index. Specifically, by inputting map information and facility information, it mechanically selects a loop route that has the functionality of an optical access network (sufficient facility capacity considering reliability and flexibility to demand fluctuations) based on the presence or absence of communication infrastructure facilities, their usage status, and the expected number of demands, and that has high cost-effectiveness relative to the number of demands under its jurisdiction, making it possible to design a loop network quickly using a computer without relying on the knowledge of an expert in access network design.

[0022] The loop wiring design device according to this embodiment includes an input unit 11, a calculation unit 12, and an output unit 13. The input unit 11 performs step S000, the calculation unit 12 performs steps S100 to S500, and the output unit 13 performs step S600. An example of a multistage loop type optical access network design method according to this disclosure performed by the calculation unit 12 is shown in FIG. 2 below. However, this disclosure can also be implemented in general loop designs that are not multistage loop types. The loop wiring design device according to this disclosure can also be realized by a computer and a program, and the program can be recorded on a recording medium or provided via a network.

[0023] In the loop wiring design method according to the present disclosure, step S100 is realized by the configuration of steps S101 to S105 described below. Here, step S104 is further composed of steps S104-1 to S104-5. Moreover, step S105 is further composed of steps S105-1 to S105-3. Each step will be described below with reference to Figs. 2 to 7. Fig. 2 shows an example of a procedure for setting a loop according to this embodiment.

[0024] (Step S101) From the map information and equipment information input from the input unit 11, point equipment (such as a communication base station, manhole, or utility pole) with a connection route of two or less directions is excluded from the search target for loop constituent point equipment while retaining the connection route information, and all loops starting from each of the communication base station, manhole, and utility pole directly connected to the tunnel are created.

[0025] For example, as shown in Fig. 3, a node search (a process of searching for a route that returns to the starting point equipment, i.e., a loop, by repeatedly searching for a point equipment connected to the starting point equipment and then searching for a point equipment connected to the point equipment connected to the starting point equipment) is performed from the point equipment 21-2 selected as the starting point, and nine point equipments, 21-1 to 21-9, are searched for as shown in Fig. 3(A). At this time, the point equipments 21-1, 21-3, 21-5, 21-6, and 21-8, which have a connection route of two or less directions, are excluded from the search target of the loop-constituting point equipment while leaving the connection route information as shown in Fig. 3(B). As a result, in this embodiment, the number of point equipments is nine in Fig. 3(A), but is four in Fig. 3(B).

[0026] This makes it possible to delete point equipment that does not contribute to the number of loop creation patterns as a route branch point without changing the shape of the connection route, and it becomes possible to reduce the amount of calculation when creating a loop. However, when two or more routes are generated between two point equipment, such as between point equipment 21-2 and point equipment 21-4 in Figure 3 (B), the loop search is performed by regarding each route as a separate route.

[0027] 3A and 3B, the connection route is shown as a straight line connecting the point facilities, but it is not limited to a straight line and may be a curved line. For example, since manholes, which are point facilities, are connected underground, the connection route connecting the manholes may be a curved line.

[0028] (Step S102) Loops that are out of the desired loop area are deleted. The desired loop area can be set to any size, and for example, in a multistage loop type optical access network, it may be set to 1 / 16 to 1 / 12 of the total area of ​​the area controlled by the communication base station. Specifically, as shown in FIG. 8, when loops L1 to L6 are created in the area controlled by the communication base station 21-X, if the desired loop area is set to 1 / 16 to 1 / 12 of the total area of ​​the area controlled by the communication base station, loops L1 and L2 that are not the desired loop area are deleted. By performing this process, it becomes possible to delete loops that are significantly out of the desired shape, and reduce the amount of calculation in the subsequent process while leaving appropriate loops. The loop area refers to the area of ​​the range surrounded by the loop on the map.

[0029] (Step S103) From the created loops, delete the loops that cross like a figure of eight, such as those configured from point equipment 21-A to 21-E shown in Fig. 5. By carrying out this process, it is possible to delete loops that cannot be used as a loop network, and reduce the amount of calculation in the subsequent processes.

[0030] (Step S104) First, the loop shape is evaluated. The loop area formed on the map is S, and the loop circumference is L. For all remaining loops, S / L (or S / L 2 ) and calculate S / L (or S / L 2 As shown in the loops 22-1 and 22-2 in FIG. 6A, if the areas are the same, the ratio S / L (or S / L 2 ) is larger, the area demand can be covered more efficiently while the installed cable length can be shortened. Therefore, 2 ) evaluation makes it possible to evaluate the cost-effectiveness of the number of required facilities.

[0031] Next, in steps S104-2 to S104-4 shown in Fig. 2, the overlapping areas between loops in the created list are evaluated and overlapping loops are deleted, starting from the top. In this embodiment, the nth loop from the top of the list is focused on, and the overlapping area between the nth loop and the i-th loop below the nth loop is evaluated and the overlapping loop is deleted. The initial value of n is 1, and the initial value of i is n+1.

[0032] In the list created in step S104-1, the overlapping area of ​​the first (corresponding to n=1 in FIG. 2) loop from the top and the second (corresponding to i=2 in FIG. 2) loop is evaluated (step S104-2), and if the overlapping area is X% or more of the area of ​​the first loop, the second loop is deleted (step S104-3). If the overlapping area of ​​the first and second loops is X% or less of the area of ​​the first loop, the second loop is retained. Next, the overlapping area of ​​the first and third loops (if the second loop is deleted, the third loop is moved up to become the second loop, so it becomes the second loop; same below) is evaluated, and if the overlapping area is X% or more of the area of ​​the first loop, the third loop is deleted. If the overlapping area of ​​the first and third loops is X% or less of the area of ​​the first loop, the third loop is retained.

[0033] In this way, the overlapping area between the first loop and each of the loops below it on the list is evaluated, and the overlapping loops are deleted (step S104-4). After the overlapping area evaluation and overlapping loop deletion process for the first loop is completed, it is confirmed whether the number of loops remaining on the list is Y or less (step S104-5). If the number of loops remaining on the list is more than Y, the same process is performed on the second loop remaining on the list. The processes from step S104-2 to step S104-5 are performed comprehensively on all loops remaining on the list until the number of loops remaining on the list is Y or less, and the remaining loops of Y or less are the finally selected loops. For example, the value of X can be set arbitrarily, and may be, for example, X=10. The value of Y can be set arbitrarily, and may be, for example, Y=10.

[0034] An example of the overlapping loop areas is shown in FIG. 6(C). In FIG. 6(C), loop 22-b has overlapping areas with loop 22-a and loop 22-c. FIG. 6(B) shows an example of the list created in step S104-1, including loops 22-a, 22-b, and 22-c shown in FIG. 6(C). The list shown in FIG. 6(B) divides the loops into S / L (or S / L 2 ) in descending order from the top, and the item numbers indicate the order counted from the top. For the sake of explanation, the list shown in Fig. 6(B) is assumed to have up to item number 5, and item numbers 4 and 5 are not shown. Steps S104-2 to S104-5 will be explained using the list shown in Fig. 6(B) as an example.

[0035] First, since the initial values ​​are n=1 and i=n+1 in Fig. 2, the overlapping areas of loop 22-a of item number 1 (first) and loop 22-b of item number 2 (second) are compared (step S104-2). Here, X=10, and since the overlapping area of ​​loop 22-a and loop 22-b is 10% or more of the loop area of ​​loop 22-a, loop 22-b is deleted (step S104-3). As a result, the overlapping areas of the loops are eliminated as shown in Fig. 6(D).

[0036] Then, the loop 22-c with item number 3 is moved up to item number 2 (not shown), and the overlapping area between the loop 22-a described in item number 1 and the loop 22-c moved up to item number 2 is compared (step S104-2). As shown in FIGS. 6C and 6D, the loop 22-a and the loop 22-c do not overlap, so the loop 22-c is left in the list. At this point, since the loop 22-c is item number 2, i is 2, and the number of loops on the list is 4 because the loop 22-b has been deleted, so 1 is added to i and the process returns to step S104-2 (step S104-4). That is, the overlapping area between the loop 22-a described in item number 1 and the loop (not shown) that has become item number 3 (old item number 4) by the move up is compared (step S104-2).

[0037] In this way, the overlapping areas of loop 22-a of item number 1 and all loops with subsequent item numbers are compared, and if the number of loops ultimately remaining in the list is greater than Y, the overlapping areas of loop 22-c of item number 2 (formerly item number 3) and all loops with subsequent item numbers are similarly compared (step S104-5).

[0038] By carrying out this process, it becomes possible to mechanically select a group of loops that are highly cost-effective in terms of the number of required tasks, have a small degree of overlap, and are independent of each other.

[0039] (Step S105) The total of the expected demand generated inside the loop and the expected demand generated outside the loop at an arbitrary distance from the loop route (within 500 [m] in this embodiment, but not limited to this) is defined as the number of demands managed by the loop, and it is confirmed whether the number of demands managed by each loop remaining in the list immediately after the processing of step S104 is within an arbitrary set range of demands (step S105-1). In this embodiment, the range of demands may be set to 100 to 300 per loop, but is not limited to this. If there is a loop whose number of demands managed is not within the range of demands managed, the loop whose number of demands managed is not within the range of demands managed is deleted from the list before the overlapping loop deletion processing (processing from step S104-2 to step S104-5), i.e., the list created in step S104-1 (step S105-2), and the overlapping loop deletion processing (processing from step S104-2 to step S104-5) is performed again using the list after step S105-2. If the number of demands handled by each loop remaining in the list falls within the range of the number of demands, each remaining loop is set as a selected loop (step S105-3).

[0040] The list shown in Fig. 7(A) is the list created in step S104-1. The list shown in Fig. 7(B) is the list after step S104-5, in which the number of demands for each loop was listed in step S105-1. As shown in Figs. 7(A) and (B), loop 22-R has been deleted as a result of performing the duplicate loop deletion process (the process from step S104-2 to step S104-5) on the list shown in Fig. 7(A). Moreover, the list shown in Fig. 7(C) is the list after step S105-3.

[0041] When the demand number range is set to 100 to 300 per loop, the loop 22-B in the list shown in FIG. 7(B) exceeds the demand number range (step S105-1). Therefore, in step S105-2, the loop 22-B is deleted from the list shown in FIG. 7(A) created in step S104-1, and the overlapping loop deletion process (steps S104-2 to S104-5) is repeated on the list including the deleted loop 22-R until all the managed demand numbers of the loops remaining in the list are within the demand number range. Then, the loops remaining in the list shown in FIG. 7(C) in which all the managed demand numbers of the loops remaining in the list are within the demand number range are selected as the selected loops. The managed demand numbers listed in the lists of FIG. 7(B) and FIG. 7(C) may be calculated based on the expected demand number information for each location included in the input map information.

[0042] By carrying out this process, it becomes possible to select a loop that handles an appropriate demand amount. This process ultimately makes it possible to select an appropriate group of loops as a loop network.

[0043] When constructing a multi-stage loop type optical access network, point equipment identified from the map information and equipment information input from the input unit 11 and located on any of the loops starting from a point equipment on the loop selected in step S105-3 (for example, from UL1 to UL4 shown in Figure 4), and point equipment with a connection route of two or less directions is excluded while leaving the connection route information as in S101, and a loop is re-created starting from a manhole or utility pole on the loop selected in step S105-3 (for example, from UL1 to UL4 shown in Figure 4) using the remaining point equipment, and steps S102 to S105 are performed for the re-created loop.

[0044] Here, the loop starting from the point equipment on the selected loop in step S105-3 will be described with reference to Figs. 9 and 10. Fig. 9(A) is an example of the result of a node search starting from the point equipment 21-12 on the upper loop UL as the selected loop, and shows a case where seven point equipments, 21-13 to 21-19, are searched for by the node search. In this case, the loops shown by solid lines in Figs. 9(B) and 10(A) to (D) can be exemplified as loops starting from the point equipment 21-12 on the upper loop UL. Therefore, in the case of the node search result shown in Fig. 9(A), for the point equipments on any of the loops shown in Figs. 9(B) and 10(A) to (D), the point equipments with a connection route of two or less directions (the point equipments 21-13, 21-15, 21-16, and 21-18 in Figs. 9 and 10) are excluded while leaving the connection route information.

[0045] The present disclosure has the feature of mechanically realizing high-speed, appropriate loop selection that is highly cost-effective relative to the demand volume by reducing the number of point facilities to be searched during loop search in step S101, deleting inappropriate loops shown in steps S102 and S103, reducing the amount of calculations, and evaluating the loops.

[0046] In addition, steps S101, S102 and S103 contribute to preventing the calculations on the computer from becoming so large that they are impossible to execute, step S104 contributes to a mechanical evaluation of high cost-effectiveness for the number of demands handled by the loop network, and step S105 contributes to a mechanical evaluation of the number of demands handled by each loop.

[0047] (Effects of the Invention) By inputting map information and facility information into the algorithm of the present invention, it is possible to mechanically design a loop network required for a loop-type optical access network using a computer, which has the effect of reducing costs in terms of not requiring the availability of skilled access network design personnel. In addition, since it is possible to mechanically select a loop network suitable for a loop-type optical access network using a computer, it has the effect of ensuring the required design quality without relying on the knowledge of skilled access network design personnel. [Industrial Applicability]

[0048] The device, method, and program for designing loop wiring according to the present disclosure can be applied to the information and communications industry. [Explanation of symbols]

[0049] 10: Loop wiring design device 11: Input section 12: Arithmetic section 13: Output section 21: point equipment 22: Loop

Claims

1. A loop wiring design device for an optical access network that is laid on a loop-shaped route passing through a telecommunications carrier base facility, comprising: creating a loop by connecting optical fibers in a loop shape on a map using equipment information including information on equipment points where optical fibers can be connected to each other and connection route information indicating routes connected by optical fibers, and map information indicating the position on a map of each equipment included in the equipment information; For the loop group consisting of the created loops, When there are overlapping loops whose loop areas on the map overlap each other by a certain amount or more, at least a part of the overlapping loops is deleted to eliminate the overlapping loops; Calculating the sum of an expected demand number occurring inside the loop and an expected demand number occurring outside the loop at an arbitrary distance from the loop for each loop after the overlapping loop is eliminated, and if there is a loop outside the demand number range where the sum is outside the arbitrarily set demand number range, deleting the loop outside the demand number range and updating the loop group; Repeating the above steps, the totals of all the loops in the loop group after the redundant loops are eliminated are all within the demand number range, designing a loop group consisting of only loops whose total falls within the demand number range as a selected loop group; Loop wiring design device.

2. The loop wiring design device described in Claim 1, characterized in that the loop is created by excluding point equipment with a connection route of two or less directions from the point equipment identified from the equipment information while leaving the connection route information, and creating a loop starting from the remaining point equipment.

3. The loop wiring design device described in claim 1, characterized in that the loop is created by excluding point equipment identified from the equipment information and located on any of the loops starting from point equipment on each loop in the selected loop group, point equipment with a connection route of two or less directions while leaving connection route information, and creating a loop starting from point equipment on each loop in the selected loop group using the remaining point equipment.

4. A wiring section is set on a map for each loop in the selected loop group, Grouping the loops in the selected loop group into upper loops and lower loops; When there are a plurality of loops in the wiring section, selecting a loop to be used based on a predetermined condition; determining the number of cores in each loop based on the selected loops, the total for each loop, the grouping, and the selection of the loops; 4. The loop wiring design device according to claim 3.

5. For all the loops created, let S be the loop area and L be the loop circumference, and then S / L (or S / L ２ ) and calculate S / L (or S / L ２ ) in descending order, 5. The loop wiring design device according to claim 1, wherein the elimination of the overlapping loops is performed by: setting a first loop in the descending order of the list as a comparison source loop; setting each loop lower in the descending order than the comparison source loop as a comparison target loop; evaluating an overlapping area on a map between the loop area of ​​the comparison source loop and the loop area of ​​the comparison target loop; and deleting from the list a comparison target loop whose overlapping area is an arbitrarily set overlapping area ratio; and repeating this process while changing the comparison source loop in the descending order until a predetermined number of loops remain in the list.

6. A loop wiring design method for an optical access network laid on a loop-shaped route passing through a telecommunications carrier base facility, the method being executed by a loop wiring design device, comprising: creating a loop by connecting optical fibers in a loop shape on a map using equipment information including information on equipment points where optical fibers can be connected to each other and connection route information indicating routes connected by optical fibers, and map information indicating the position on a map of each equipment included in the equipment information; For the loop group consisting of the created loops, When there are overlapping loops whose loop areas on the map overlap each other by a certain amount or more, at least a part of the overlapping loops is deleted to eliminate the overlapping loops; Calculating the sum of an expected demand number occurring inside the loop and an expected demand number occurring outside the loop at an arbitrary distance from the loop for each loop after the overlapping loop is eliminated, and if there is a loop outside the demand number range where the sum is outside the arbitrarily set demand number range, deleting the loop outside the demand number range and updating the loop group; Repeating the above steps, the totals of all the loops in the loop group after the redundant loops are eliminated are all within the demand number range, A loop wiring design method for designing a loop group consisting of only loops whose total falls within the demand number range as a selected loop group.

7. A program for causing a computer to function as the loop wiring design device according to any one of claims 1 to 5.

Images