Transmission path design apparatus, transmission network topology design method, and transmission path design program for designing a communication path topology optimized in view of reducing amount of equipment needed

11824,762

17/619982

June 17, 2019

To easily design a communication path topology optimized in view of reducing the amount of equipment needed under the condition that availability against multiple failures in a network is maintained. A transmission path design apparatus (100) performs: a step (S14) of extracting, from the multiple base stations, a first group of base stations whose number of communication-path routes connected is large, based on transmission network model initial data (D0); a step (S16) of extracting a first group of communication paths connecting the base stations in the first group; a step (S16) of calculating a both-end path value (d_i,j) for each communication path in the first group; and steps (S18 to S24) of determining the communication path whose both-end path value satisfies a predetermined condition as a thinning-out target communication path, and generating output data Dy in which the thinning-out target communication path is reflected on the transmission network model initial data. The optimized output data (Dy) can be generated by extracting a deletable communication path in order from the model of the initial data (D0).

Nippon Telegraph and Telephone Corporation (Tokyo, JP)

Nippon Telegraph and Telephone Corporation (Tokyo, JP)

1. A transmission path design apparatus comprising: an initial data holding unit, implemented in one or more computers, that is configured to hold 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 one or more communication paths that are configured in a mesh shape as a whole; a model calculation unit, implemented in one or more computers, that is configured to: acquire initial data of a transmission network model held by the initial data holding unit, extract, from the multiple base stations in the transmission network model, a first group of base stations each of which has a number of communication-path routes connected thereto greater than a specified value, extract, from the one or more communication paths, a first group of communication paths each of which connects the base stations in the first group, determine a first base station connected to a first end of each of the communication paths in the first group and a second base station connected to a second end of the each of the communication paths in the first group, calculate a both-end path value based on a number of the communication-path routes of the first base station and a number of the communication-path routes of the second base station, determine, 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 generate 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 is configured to output data generated by the model calculation unit.

2. The transmission path design apparatus according to claim 1 , wherein the model calculation unit is configured to: calculate the both-end path value as a product of the number of communication-path routes of the first base station and the number of communication-path routes of the second base station, determine the thinning-out target communication path from the communication paths in the first group in descending order from the communication path with the largest both-end path value, and repeat the determination of the thinning-out target communication path until a predetermined end condition is satisfied.

3. The transmission path design apparatus according to claim 2 , wherein the model calculation unit is configured to: determine a plurality of segmenting lines each of which divides the whole transmission network model into two regions, calculate the number of communication paths that each of the segmenting lines intersects as a number of cuts, determine a minimum value of the number of cuts, and determine whether the thinning-out target communication path satisfies a predetermined condition based on the minimum value of the number of cuts.

4. The transmission path design apparatus according to claim 3 , wherein the model calculation unit is configured to: create a model of a regional transmission network including a plurality of regional base stations each of which accommodates traffic of multiple user terminals and a plurality of higher-order base stations each of which accommodates traffic of a plurality of regional base stations as a transmission network model and limits the minimum value of the number of cuts to two or more.

5. A transmission network topology design method comprising: acquiring 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; extracting a first group of base stations each of which has a number of communication-path routes connected thereto is greater than a specified value from the multiple base stations in the transmission network model; extracting, from the one or more communication paths, a first group of communication paths each of which connects the base stations in the first group; determining a first base station connected to a first end of each of the communication paths in the first group and a second base station connected to a second end of the each of the communication paths in the first group; calculating a both-end path value based on a number of the communication-path routes of the first base station and a number of the communication-path routes of the second base station; 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.

6. The transmission network topology design method according to claim 5 , comprising: calculating the both-end path value as a product of the number of communication-path routes of the first base station and the number of communication-path routes of the second base station; and determining the thinning-out target communication path from the communication paths in the first group in descending order from the communication path with the largest both-end path value and repeating the determination of the thinning-out target communication path until a predetermined end condition is satisfied.

7. The transmission network topology design method according to claim 6 , comprising: determining a plurality of segmenting lines each of which divides the whole transmission network model into two regions, calculating the number of communication paths that each of the segmenting lines intersects as a number of cuts, determining a minimum value of the number of cuts, and determining whether the thinning-out target communication path satisfies a predetermined condition based on the minimum value of the number of cuts.

8. A non-transitory computer medium having stored thereon a transmission path design program causing a computer to perform operation comprising: acquiring 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; extracting a first group of base stations each of which has a number of communication-path routes connected thereto is greater than a specified value from the multiple base stations in the transmission network model; extracting, from the one or more communication paths, a first group of communication paths each of which connects the base stations in the first group; determining a first base station connected to a first end of each of the communication paths in the first group and a second base station connected to a second end of the each of the communication paths in the first group; calculating a both-end path value based on a number of the communication-path routes of the first base station and a number of the communication-path routes of the second base station 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.

9. The non-transitory computer medium according to claim 8 , wherein the operations further comprise: calculating the both-end path value as a product of the number of communication-path routes of the first base station and the number of communication-path routes of the second base station; and determining the thinning-out target communication path from the communication paths in the first group in descending order from the communication path with the largest both-end path value and repeating the determination of the thinning-out target communication path until a predetermined end condition is satisfied.

10. The non-transitory computer medium according to claim 9 , wherein the operations further comprise: determining a plurality of segmenting lines each of which divides the whole transmission network model into two regions; calculating the number of communication paths that each of the segmenting lines intersects as a number of cuts; determining a minimum value of the number of cuts; and determining whether the thinning-out target communication path satisfies a predetermined condition based on the minimum value of the number of cuts.

6278689 August 2001 Afferton
6744769 June 2004 Siu
6970417 November 2005 Doverspike
7043250 May 2006 DeMartino
7209975 April 2007 Zang
7274869 September 2007 Pan
7283741 October 2007 Sadananda
20010033548 October 2001 Saleh
20020035640 March 2002 Greenberg
20020131424 September 2002 Suemura
20020191247 December 2002 Lu
20030185148 October 2003 Shinomiya
20040114925 June 2004 Berthold
20040184402 September 2004 Alicherry
20050197993 September 2005 Korotky
20050265258 December 2005 Kodialam
20060104641 May 2006 Casanova
20070212067 September 2007 Miyazaki
20080181605 July 2008 Palacharla
20080212497 September 2008 Getachew
20090046572 February 2009 Leung
20090232492 September 2009 Blair
20100129078 May 2010 Weston-Dawkes
20100129082 May 2010 Zhong
20100142961 June 2010 Wisseman
20100226244 September 2010 Mizutani
20100290780 November 2010 Teipen
20110182576 July 2011 Zhou
20110222846 September 2011 Boertjes
20120224851 September 2012 Takara
20120250580 October 2012 Testa
20120294618 November 2012 Yu
20130115961 May 2013 Shibayama
20130258842 October 2013 Mizutani
20130272693 October 2013 Zhang
20140056584 February 2014 Testa
20140126899 May 2014 Prakash
20140169782 June 2014 Hashiguchi
20140348504 November 2014 Blair
20150055953 February 2015 Guy
20150071633 March 2015 Mehrvar
20150071635 March 2015 Naito
20150103643 April 2015 Fujioka
20150156106 June 2015 Allan
20160127034 May 2016 Wellbrock
20160315695 October 2016 Aoki
20160315697 October 2016 Breukelaar
20160365921 December 2016 Costantini
20170279557 September 2017 Kilper
20170338905 November 2017 Tsuzuki
20180343685 November 2018 Hart
20190149229 May 2019 Yilmaz
20190191354 June 2019 Tan
20190327016 October 2019 Bathula
20200177299 June 2020 Bravi
20210226706 July 2021 Yutaka
20210349265 November 2021 Menard

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. cited by examiner
Gringeri, Steven, et al. “Flexible architectures for optical transport nodes and networks.” IEEE Communications Magazine 48.7 (2010): 40-50. cited by examiner
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. cited by examiner
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). cited by applicant

edspgr.11824762