This application is a National Stage application under 35 U.S.C. § 371 of International Application No. PCT/JP2019/023936, having an International Filing Date of Jun. 17, 2019. The disclosure of the prior application is considered part of the disclosure of this application, and is incorporated in its entirety into this application.
The present invention relates to a transmission path design apparatus, a transmission network topology design method, and a transmission path design program that can be used for designing regional transmission networks or the like.
There is a demand for reducing operating costs of equipment and maintenance of optical transmission networks used for regional transmission networks or the like while maintaining high communication quality and availability as a common infrastructure. In addition, the regional transmission networks, which are desired to efficiently accommodate user traffic, commonly have a multi-ring configuration that simply ensures path redundancy by using a two-direction ROADM (Reconfigurable Optical Add/Drop Multiplexer). However, to maintaining high availability, quick recovery measures are needed, and therefore, a large-scale maintenance system is needed.
Further, in recent years, enhancement of countermeasures against wide-area disasters has become an important issue. However, in the case of the redundancy provided by the multi-ring configuration, division of a network and isolation could occur due to a wide-area disaster. NPL 1 proposes to increase availability of regional transmission networks by using a multiple direction OXC (optical cross-connect) to construct an optical transmission network having a mesh configuration so that, when a failure occurs, a route that bypasses the faulty location is set (restored).
However, compared to a case with the multi-ring configuration, a case with the mesh configuration described in NPL 1 uses more communication paths (links) between buildings each of which accommodates communication equipment of a communication base station. Namely, the adoption of the mesh configuration leads to an increase in the amount of equipment such as an inter-station amplifier. This causes a concern of an increase in the operating costs of the equipment and maintenance.
Thus, there is a demand for a communication path topology such that, under a condition that availability against multiple failures is maintained, the communication paths between the buildings are thinned out to reduce the amount of equipment needed. However, an operation of designing such an optimized communication path topology is not easy.
With the foregoing in view, it is an object of the present invention to provide a transmission path design apparatus, a transmission network topology design method, and a transmission path design program that can easily design a communication path topology optimized in view of reducing the amount of equipment needed, under the condition that availability against multiple failures is maintained.
A transmission path design apparatus of the present invention includes: an initial data holding unit that holds initial data of a transmission network model in which a plurality of base stations adjacent to each other in a transmission network having multiple base stations are connected by communication paths that are configured in a mesh shape as a whole; a model calculation unit that acquires initial data of a transmission network model held by the initial data holding unit and extracts, from the multiple base stations in the transmission network model, a first group of base stations each of which has the number of communication-path routes connected thereto larger than a specified value, extracts, from the communication paths, a first group of communication paths each of which connects the base stations in the first group, determines a first base station connected to one end of each of the communication paths in the first group and a second base station connected to an opposite end of the each of the communication paths in the first group, calculates a both-end path value based on the number of the communication-path routes of the first base station and the number of the communication-path routes of the second base station, determines, in the first group of communication paths, the communication path whose both-end path value satisfies a predetermined condition as a thinning-out target communication path, and generates output data in which the thinning-out target communication path is reflected on the initial data of the transmission network model; and a data output unit that outputs output data generated by the model calculation unit.
According to a transmission network topology design method, a transmission path design program, and a transmission path design apparatus of the present invention, under the condition that availability against multiple failures is maintained, a communication path topology optimized in view of reducing the amount of equipment needed can be easily designed. In other words, it is possible to automate designing of a communication path topology and assist the design work of a designer.
An embodiment of the present invention will be described below with reference to the drawings.
<Description of Environment to which Invention is Applied>
<Configuration Example of Optical Transmission Network>
The optical transmission network illustrated in
The regional transmission network 10 is a communication network connecting a plurality of buildings in an urban area or the like, that is, a metro network. In an example in
The communication network N12 connects the regional representative building 16 and the regional buildings 13 and 14 to one another via optical fiber communication paths configured in a ring shape. The communication network N01 connects prefectural representative buildings 17 and 18 and the regional representative buildings 15 and 16 to one another via optical fiber communication paths configured in a ring shape.
In addition, in the example in
Since each of the ring-shaped communication paths of the communication networks N01, N11, N12, and N31 is redundant, the communication equipment connected to the ring-shaped communication paths can communicate using a clockwise path or a counterclockwise path on the ring-shaped communication paths. This provides tolerance for a failure such as a line disconnection.
As illustrated in
The optical switch 16a is connected to one end N01a of the communication network N01 via the inter-station interface 16b and to another end N01b of the communication network N01 via the inter-station interface 16c. The optical switch 16f is connected to one end N12a of the communication network N12 via the inter-station interface 16g and to another end N12b of the communication network N12 via the inter-station interface 16h. The transponder 16d and the transponder 16e are connected to each other.
Likewise, the regional building 13 illustrated in
<Regional Transmission Network Modeling>
In the example of the model illustrated in
<Regional Transmission Network Model with Multi-Ring Configuration>
In the model illustrated in
In addition, ring communication networks R21, R22, R23, R24, R25, and R26 are connected to the buildings B11, B12, B21, B22, B23, and B24, respectively. The ring communication network R21 connects the building B11 and regional buildings near the building B11 via a ring-shaped communication path. The ring communication network R22 connects the building B12 and regional buildings near the building B12 via a ring-shaped communication path. The ring communication network R23 connects the building B21 and regional buildings near the building B21 via a ring-shaped communication path. The ring communication network R24 connects the building B22 and regional buildings near the building B22 via a ring-shaped communication path. The ring communication network R25 connects the building B23 and regional buildings near the building B23 via a ring-shaped communication path. The ring communication network R26 connects the building B24 and regional buildings near the building B24 via a ring-shaped communication path.
Assuming a situation where a large-scale disaster has occurred, a failure such as a line disconnection is assumed to simultaneously occur at multiple locations in a certain area. For example, in a case where the communication paths are simultaneously disconnected at two faulty locations R25a and R25b in the model illustrated in
<Regional Transmission Network Model with Mesh Configuration>
In the models illustrated in
In the model in
In contrast, in the model in
That is to say, in the regional transmission network with the multi-ring configuration illustrated in
However, the configuration of the communication paths with the mesh configuration as illustrated in
A transmission path design apparatus, a transmission network topology design method, and a transmission path design program of the present invention described below can be used for, upon designing a regional transmission network using a model with a mesh configuration, automating or assisting an operation for optimizing the transmission network topology by reducing the number of communication paths connecting adjacent buildings while maintaining availability against multiple failures that simultaneously occur.
<Configuration Example of Transmission Path Design Apparatus>
As with the case of a common computer system such as a personal computer, the transmission path design apparatus 100 illustrated in
The storage device 44 illustrated in
The initial data 52 of the regional transmission network model is created and prepared by a designer in advance before the transmission path topology design program 51 is executed or automatically created by the transmission path topology design program 51. Further, when the transmission path topology design program 51 processes the initial data 52 and D0 of the regional transmission network model, the optimized data 53 of the regional transmission network model is automatically generated as the output data Dy.
<Processing Procedure of Transmission Network Topology Design Method and Transmission Path Design Program>
In the first step S11, the computer main body 41 creates initial data D0 of a communication path topology model by an input operation of a designer or by a predetermined algorithm included in the transmission path topology design program 51 and stores the initial data D0 in the storage device 44. This initial data D0 is, for example, data having a communication path configuration in a mesh shape as illustrated in
In the next step S12, the computer main body 41 receives the input operation of the designer related to a value of a parameter n of multiple failure tolerance. Alternatively, the computer main body 41 determines the parameter n of multiple failure tolerance by the transmission path topology design program 51. In the present embodiment, since the topology is designed assuming that isolation of a building does not occur even if failures simultaneously occur in two communication paths in the event of a large-scale disaster, the parameter n of the multiple failure tolerance is limited to a value of “2” or more.
In step S13, the computer main body 41 executing the transmission path topology design program 51 reads the initial data D0 from the storage device 44 and sets the read data as an initial value of intermediate data Dx. The computer main body 41 performs each step thereafter by executing the transmission path topology design program 51.
In step S14, the computer main body 41 extracts a whole group of buildings Bx each of which has the “number of communication-path routes” larger than n+1 from the model of the intermediate data Dx.
In step S15, the computer main body 41 determines whether the extracted group of buildings Bx does not exist, in other words, whether the extracted group of buildings Bx has been processed and is empty. If the computer main body 41 determines that the extracted group of buildings Bx exists and there is an unprocessed building, namely, the group of buildings Bx is not empty (No), the processing proceeds to step S16. If the computer main body 41 determines that the extracted group of buildings Bx does not exist or there is no unprocessed building, namely, the group of buildings Bx is empty (Yes), the computer main body 41 outputs the intermediate data Dx as output data Dy (S25) and ends the processing in
In step S16, the computer main body 41 calculates a “both-end path value d_i,j” for each of the communication paths connected to the group of buildings Bx. The computer main body 41 calculates the “both-end path value d_i,j” by using the following equation (1).
d_i,j=d_i×d_j (1)
In step S17, the computer main body 41 initializes an index k to “1”.
In step S18, the computer main body 41 extracts a specific communication path having the k-th largest “both-end path value d_i,j” and creates temporary data Dt based on a result of thinning out this specific communication path from the intermediate data Dx. The thinning-out of the specific communication path in step S18 is “provisional deletion”, which is not yet finalized. Thus, the result of the “provisional deletion” is regarded as the temporary data Dt.
In step S19, the computer main body 41 performs the process of “minimum cut calculation” illustrated in detail in
In step S20, the computer main body 41 determines whether the minimum number of cuts Nc determined in step S19 is equal to or less than the parameter n of multiple failure tolerance, namely, whether a condition of “Nc≤n” is satisfied. If the computer main body 41 determines that the minimum number of cuts Nc is equal to or less than the parameter n of multiple failure tolerance (Yes), the processing proceeds to step S21, and if the minimum number of cuts Nc exceeds the parameter n of multiple failure tolerance (No), the processing proceeds to step S24.
That is, if the condition of “Nc≤n” is satisfied, the condition of the multiple failure tolerance is not satisfied due to the impact of the specific communication path that has been thinned out immediately before as the “provisional deletion” in step S18. Thus, the computer main body 41 discards the temporary data Dt in which the “provisional deletion” is reflected, and the processing proceeds to step S21 to search for a next target communication path to be thinned out.
In step S21, the computer main body 41 adds +1 to the index k to update this value. Next, in step S22, the computer main body 41 determines whether the updated index k value is larger than the absolute value of the “both-end path value d_i,j”, namely, whether a condition of “k>|d_i,j|” is satisfied. If the computer main body 41 determines that the condition of “k>|d_i,j|” is satisfied (Yes), the processing proceeds to step S23, and if this condition is not satisfied, the processing proceeds to step S18.
In step S23, the computer main body 41 outputs the current temporary data Dt as output data Dy and ends this processing.
In step S24, the computer main body 41 allocates the current temporary data Dt to the subsequent intermediate data Dx. That is, the computer main body 41 accepts the “provisional deletion” of the specific communication path in step S18 as the intermediate data Dx, and the processing proceeds to step S14.
The “minimum cut calculation” in
Next, in step S32, the computer main body 41 individually calculates the numbers of cuts Nc1 to Ncn of the communication paths intersected by each of the various segmenting lines SL1 to SLn.
In step S33, the computer main body 41 selects the minimum value of the numbers of cuts Nc1 to Ncn calculated in step S32 and sets the selected value as the minimum number of cuts Nc.
<Changes in Configuration by Optimization>
In the model in the initial state illustrated in
In
Assuming that the parameter n of multiple failure tolerance is “2”, the group of buildings Bx whose “number of communication-path routes” is more than “3” is extracted in step S14 in
In addition, since the communication path to be processed in step S16 of
Thus, in the example in
One segmenting line SL2 illustrated in
In practice, the number of cuts is calculated for each of a large number n (the number is undefined) of segmenting lines SL1 to SLn. However, in the example in
The computer main body 41 repeats each process illustrated in
That is, the computer main body 41 performs each process illustrated in
In the example illustrated in
<Example of Segmenting Lines>
To evaluate whether or not the specific communication path thinned out as a provisional deletion in step S18 is appropriate, the transmission network topology design method and the transmission path design program illustrated in
As illustrated in
Here, focusing on the first segmenting line SL1, it can be seen that this segmenting line SL1 cuts the inter-station communication paths L indicated by solid lines at four locations. That is, in the case of the segmenting line SL1 in
Further, the second segmenting line SL2 in
Thus, in the example in
<Advantages of the Above Embodiment>
The model calculation unit acquires initial data of a transmission network model held by the initial data holding unit and extracts, from the multiple base stations in the transmission network model, a first group of base stations each of which has the number of communication-path routes connected thereto larger than a specified value. Further, the model calculation unit extracts, from the communication paths, a first group of communication paths each of which connects the base stations in the first group and determines a first base station connected to one end of each of the communication paths in the first group and a second base station connected to an opposite end of the each of the communication paths in the first group. Next, the model calculation unit calculates a both-end path value based on the number of the communication-path routes of the first base station and the number of the communication-path routes of the second base station. Further, the model calculation unit determines, in the first group of communication paths, the communication path whose both-end path value satisfies a predetermined condition as a thinning-out target communication path and generates output data in which the thinning-out target communication path is reflected on the initial data of the transmission network model.
According to the transmission path design apparatus of the above (1), the first group of base stations is extracted so that the base station having a larger margin against multiple failures of the communication paths, namely, the base station having a margin for thinning out the communication path can be specified. Further, the first group of communication paths, which connect the base stations in the first group to each other, can be used as a thinning-out candidate. Further, the both-end path value calculated for each of the communication paths in the first group can be used for determining the priority in the thinning-out candidate communication paths. Thus, among the thinning-out candidate communication paths, the one having a higher priority can be thinned out. As a result, an optimized transmission network topology can be obtained as the output data. That is to say, under the condition that availability against multiple failures is maintained, a communication path topology optimized in view of reducing the amount of equipment needed can be easily designed.
According to the transmission path design apparatus of the above (2), while availability of the transmission network against multiple failures, which is specified by a parameter n, is maintained, the total number of communication paths included in the transmission network can be efficiently reduced by selecting the transmission path that can be thinned out in descending order of priority.
According to the transmission path design apparatus of the above (3), the minimum number of cuts Nc needed for determining whether the provisional deletion of the specific thinning-out target communication path being focused maintains availability against multiple failures, which is defined by a parameter n, can be determined.
According to the transmission path design apparatus of the above (4), in the event of a large-scale disaster, even if two or more failures, for example, the faulty locations L01 and L02 as illustrated in
In addition, the transmission network topology design method of the present invention includes a step of extracting a first group of base stations each of which has the number of communication-path routes connected thereto is larger than a specified value from the multiple base stations in the transmission network model.
The transmission network topology design method of the present invention also includes a step of extracting, from the communication paths, a first group of communication paths each of which connects the base stations in the first group.
In addition, the transmission network topology design method of the present invention includes a step of determining a first base station connected to one end of each of the communication paths in the first group and a second base station connected to an opposite end of the each of the communication paths in the first group and calculating a both-end path value based on the number of the communication-path routes of the first base station and the number of the communication-path routes of the second base station.
Further, the transmission network topology design method of the present invention includes a step of determining, in the first group of communication paths, the communication path whose both-end path value satisfies a predetermined condition as a thinning-out target communication path and generating output data in which the thinning-out target communication path is reflected on the initial data of the transmission network model.
According to the transmission network topology design method of the above (4), the first group of base stations is extracted so that the base station having a larger margin against multiple failures of the communication paths, namely, the base station having a margin for thinning out the communication path can be specified. Further, the first group of communication paths, which connect the base stations in the first group to each other, can be used as a thinning-out candidate. Further, the both-end path value calculated for each of the communication paths in the first group can be used for determining the priority in the thinning-out candidate communication paths. Thus, among the thinning-out candidate communication paths, the one having a higher priority can be thinned out. As a result, an optimized transmission network topology can be obtained as the output data. That is to say, under the condition that availability against multiple failures is maintained, a communication path topology optimized in view of reducing the amount of equipment needed can be easily designed.
According to the transmission network topology design method including the steps in the above (6), while availability of the transmission network against multiple failures, which is specified by a parameter n, is maintained, the total number of communication paths included in the transmission network can be efficiently reduced by selecting the transmission path that can be thinned out in descending order of priority.
According to the transmission network topology design method including the steps of the above (7), the minimum number of cuts Nc needed for determining whether the provisional deletion of the specific thinning-out target communication path being focused maintains the availability against multiple failures, which is defined by a parameter n, can be determined.
According to the transmission path design program of the above (8), the first group of base stations is extracted so that the base station having a larger margin against multiple failures of the communication paths, namely, the base station having a margin for thinning out the communication path can be specified. Further, the first group of communication paths, which connect the base stations in the first group to each other, can be used as a thinning-out candidate. Further, the both-end path value calculated for each of the communication paths in the first group can be used for determining the priority in the thinning-out candidate communication paths. Thus, among the thinning-out candidate communication paths, the one having a higher priority can be thinned out. As a result, an optimized transmission network topology can be obtained as the output data. That is to say, under the condition that availability against multiple failures is maintained, a communication path topology optimized in view of reducing the amount of equipment needed can be easily designed.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/JP2019/023936 | 6/17/2019 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2020/255216 | 12/24/2020 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
6278689 | Afferton | Aug 2001 | B1 |
6744769 | Siu | Jun 2004 | B1 |
6970417 | Doverspike | Nov 2005 | B1 |
7043250 | DeMartino | May 2006 | B1 |
7209975 | Zang | Apr 2007 | B1 |
7274869 | Pan | Sep 2007 | B1 |
7283741 | Sadananda | Oct 2007 | B2 |
20010033548 | Saleh | Oct 2001 | A1 |
20020035640 | Greenberg | Mar 2002 | A1 |
20020131424 | Suemura | Sep 2002 | A1 |
20020191247 | Lu | Dec 2002 | A1 |
20030185148 | Shinomiya | Oct 2003 | A1 |
20040114925 | Berthold | Jun 2004 | A1 |
20040184402 | Alicherry | Sep 2004 | A1 |
20050197993 | Korotky | Sep 2005 | A1 |
20050265258 | Kodialam | Dec 2005 | A1 |
20060104641 | Casanova | May 2006 | A1 |
20070212067 | Miyazaki | Sep 2007 | A1 |
20080181605 | Palacharla | Jul 2008 | A1 |
20080212497 | Getachew | Sep 2008 | A1 |
20090046572 | Leung | Feb 2009 | A1 |
20090232492 | Blair | Sep 2009 | A1 |
20100129078 | Weston-Dawkes | May 2010 | A1 |
20100129082 | Zhong | May 2010 | A1 |
20100142961 | Wisseman | Jun 2010 | A1 |
20100226244 | Mizutani | Sep 2010 | A1 |
20100290780 | Teipen | Nov 2010 | A1 |
20110182576 | Zhou | Jul 2011 | A1 |
20110222846 | Boertjes | Sep 2011 | A1 |
20120224851 | Takara | Sep 2012 | A1 |
20120250580 | Testa | Oct 2012 | A1 |
20120294618 | Yu | Nov 2012 | A1 |
20130115961 | Shibayama | May 2013 | A1 |
20130258842 | Mizutani | Oct 2013 | A1 |
20130272693 | Zhang | Oct 2013 | A1 |
20140056584 | Testa | Feb 2014 | A1 |
20140126899 | Prakash | May 2014 | A1 |
20140169782 | Hashiguchi | Jun 2014 | A1 |
20140348504 | Blair | Nov 2014 | A1 |
20150055953 | Guy | Feb 2015 | A1 |
20150071633 | Mehrvar | Mar 2015 | A1 |
20150071635 | Naito | Mar 2015 | A1 |
20150103643 | Fujioka | Apr 2015 | A1 |
20150156106 | Allan | Jun 2015 | A1 |
20160127034 | Wellbrock | May 2016 | A1 |
20160315695 | Aoki | Oct 2016 | A1 |
20160315697 | Breukelaar | Oct 2016 | A1 |
20160365921 | Costantini | Dec 2016 | A1 |
20170279557 | Kilper | Sep 2017 | A1 |
20170338905 | Tsuzuki | Nov 2017 | A1 |
20180343685 | Hart | Nov 2018 | A1 |
20190149229 | Yilmaz | May 2019 | A1 |
20190191354 | Tan | Jun 2019 | A1 |
20190327016 | Bathula | Oct 2019 | A1 |
20200177299 | Bravi | Jun 2020 | A1 |
20210226706 | Yutaka | Jul 2021 | A1 |
20210349265 | Menard | Nov 2021 | A1 |
Entry |
---|
Tibuleac, Sorin, and Mark Filer. “Transmission impairments in DWDM networks with reconfigurable optical add-drop multiplexers.” Journal of Lightwave Technology 28.4 (2009): 557-598. |
Gringeri, Steven, et al. “Flexible architectures for optical transport nodes and networks.” IEEE Communications Magazine 48.7 (2010): 40-50. |
Choudhury, Gagan, et al. “Two use cases of machine learning for SDN-enabled IP/optical networks: Traffic matrix prediction and optical path performance prediction.” Journal of Optical Communications and Networking 10.10 (2018): D52-D62. |
Yamamoto et al., “Highly available metro transport network using multiple direction OXC,” IEICE Technical Report, 2019, 118(465):261-265, 11 pages (with English Translation). |
Number | Date | Country | |
---|---|---|---|
20220360520 A1 | Nov 2022 | US |