IP Library Granted Patent US 12,445,371
Granted Patent B2
US 12,445,371 · App. 18/034,288 · Granted Oct 14, 2025

Communication path finding device, communication path finding method, and program

Inventors: Takafumi Tanaka (Musashino, JP); Takuya Ohara (Musashino, JP); Fumikazu Inuzuka (Musashino, JP); Takuya Oda (Musashino, JP); Masayuki Shimoda (Musashino, JP)
Assignee: NTT, Inc.
H04L45/24
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,445,371
App. No.
18/034,288
Granted
Oct 14, 2025
Kind
B2
Abstract

An aspect of the present invention is a communication path search device that constructs a multicast path of a plurality of nodes connected to a network, the communication path search device including a network device information management unit configured to manage a device specification including constraint information on the number of branches of each of the nodes on the network, a network topology management unit configured to manage link information between the nodes on the network, and a multicast tree calculation unit configured to construct a Steiner tree of a path connecting a start node and an end node based on a new request, an existing request, the constraint information on the number of branches of each of the nodes, constraint information on a maximum number of branches of each of the nodes, and the link information, the new request and the existing request each including start node and end node information.

Claims (20)

1. A communication path search device that constructs a multicast path of a plurality of nodes connected to a network, the communication path search device comprising:

a network device information management unit configured to manage a device specification including constraint information on a maximum number of branches of each of the nodes on the network;

a network topology management unit configured to manage link information between the nodes on the network; and

a multicast tree calculation unit configured to construct a Steiner tree of a path connecting a start node and an end node based on a new request, an existing request, the constraint information on the number of branches of each of the nodes, and the link information, the new request and the existing request each including start node and end node information.

2. A communication path search device that constructs a multicast path of a plurality of nodes connected to a network, the communication path search device comprising:

a network device information management unit configured to manage a device specification including constraint information on a maximum number of branches of each of the nodes on the network;

a network topology management unit configured to manage link information between the nodes on the network; and

a multicast tree calculation unit configured to construct a Steiner tree of a path connecting a start node and an end node based on a plurality of requests, the constraint information on the number of branches of each of the nodes, and the link information, the plurality of requests each including start node and end node information.

3. The communication path search device according to claim 1 , wherein,

in a case where the number of branches of each of the nodes in the constructed Steiner tree is larger than the maximum number of branches, the multicast tree calculation unit reconstructs the Steiner tree to increase a link cost between a node having more branches than the maximum number of branches and a node having a smallest link cost from the node.

4. The communication path search device according to claim 2 , wherein,

in a case where the number of branches of each of the nodes in the constructed Steiner tree is larger than the maximum number of branches, the multicast tree calculation unit reconstructs the Steiner tree to increase a link cost between a node having more branches than the maximum number of branches and a node having a smallest link cost from the node.

5. A communication path search method for constructing a multicast path of a plurality of nodes connected to a network, the communication path search method comprising

constructing, by a multicast tree calculation unit, a Steiner tree of a path connecting a start node and an end node based on a new request, an existing request, constraint information on a maximum number of branches of each of the nodes on the network, and link information between the nodes on the network, the new request and the existing request each including start node and end node information.

6. A communication path search method for constructing a multicast path of a plurality of nodes connected to a network, the communication path search method comprising

constructing, by a multicast tree calculation unit, a Steiner tree of a path connecting a start node and an end node based on a plurality of requests, constraint information on a maximum number of branches of each of the nodes on the network, and link information between the nodes on the network, the plurality of requests each including start node and end node information.

7. A non-transitory computer readable storage medium storing a program for causing a computer to

construct a Steiner tree of a path connecting a start node and an end node based on a new request, an existing request, constraint information on a maximum number of branches of each of nodes on a network, and link information between the nodes on the network, the new request and the existing request each including start node and end node information.

8. A non-transitory computer readable storage medium storing a program for causing a computer to

construct a Steiner tree of a path connecting a start node and an end node based on a plurality of requests, constraint information on a maximum number of branches of each of nodes on a network, and link information between the nodes on the network, the plurality of requests each including start node and end node information.

Assignments (2)
CHANGE OF NAME Recorded Sep 11, 2025
From: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
To: NTT, INC.
Reel/Frame 072873/0667 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 27, 2023
From: TANAKA, TAKAFUMI; OHARA, TAKUYA; INUZUKA, FUMIKAZU; ODA, TAKUYA; SHIMODA, MASAYUKI
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 063467/0214 →
Continuity (1)
Related Publication 20250016089A1 · Jan 9, 2025
References Cited (66)
US 6678524B1 · Hansson et al. · 2004 [cited by applicant]
US 6914972B1 · Baumeister et al. · 2005 [cited by applicant]
US 7519049B2 · Masuda · 2009 [cited by applicant]
US 7822065B2 · Lu · 2010 [cited by applicant]
US 8719534B1 · Ray, III et al. · 2014 [cited by applicant]
US 9141420B2 · Chang et al. · 2015 [cited by applicant]
US 9146769B1 · Shankar et al. · 2015 [cited by applicant]
US 9780909B2 · Wood · 2017 [cited by examiner]
US 9785478B1 · Babu B R et al. · 2017 [cited by applicant]
US 10904136B2 · Allan · 2021 [cited by examiner]
US 11089105B1 · Karumbunathan et al. · 2021 [cited by applicant]
US 11301407B2 · Sen et al. · 2022 [cited by applicant]
US 20010009031A1 · Nitta · 2001 [cited by examiner]
US 20030184651A1 · Ohsawa et al. · 2003 [cited by applicant]
US 20060171713A1 · Feng · 2006 [cited by applicant]
US 20070079307A1 · Dhawan et al. · 2007 [cited by applicant]
US 20080235361A1 · Crosbie et al. · 2008 [cited by applicant]
US 20090240790A1 · Utsunomiya et al. · 2009 [cited by applicant]
US 20100042636A1 · Lu · 2010 [cited by applicant]
US 20110126047A1 · Anderson et al. · 2011 [cited by applicant]
US 20120117563A1 · Chang et al. · 2012 [cited by applicant]
US 20120327953A1 · Vokkarane et al. · 2012 [cited by applicant]
US 20130262390A1 · Kumarasamy et al. · 2013 [cited by applicant]
US 20140019621A1 · Khan et al. · 2014 [cited by applicant]
US 20140181984A1 · Kundu et al. · 2014 [cited by applicant]
US 20140258533A1 · Antony · 2014 [cited by applicant]
US 20150363219A1 · Kasturi et al. · 2015 [cited by applicant]
US 20170235817A1 · Deodhar et al. · 2017 [cited by applicant]
US 20170317780A1 · Wood · 2017 [cited by examiner]
US 20180191601A1 · Micallef · 2018 [cited by applicant]
US 20190042325A1 · Nair · 2019 [cited by applicant]
US 20190327144A1 · Tembey et al. · 2019 [cited by applicant]
US 20190339320A1 · Dzafic · 2019 [cited by applicant]
US 20200218684A1 · Sen et al. · 2020 [cited by applicant]
US 20200412657A1 · Jang et al. · 2020 [cited by applicant]
US 20220158756A1 · Wang et al. · 2022 [cited by applicant]
EP 3041311A1 · 2016 [cited by applicant]
JP H10117215A · 1998 [cited by applicant]
JP 2003535526A · 2003 [cited by applicant]
JP 2005064970A · 2005 [cited by applicant]
JP 2006527541A · 2006 [cited by applicant]
JP 2010521761A · 2010 [cited by applicant]
JP 2012505561A · 2012 [cited by applicant]
JP 2015065527A · 2015 [cited by applicant]
JP 2015527649A · 2015 [cited by applicant]
KR 1020140003200A · 2014 [cited by applicant]
WO WO0193607A1 · 2001 [cited by applicant]
WO WO2004111775A2 · 2004 [cited by applicant]
WO WO2010041582A1 · 2010 [cited by applicant]
WO WO2015029416A1 · 2015 [cited by applicant]
WO WO2020143380A1 · 2020 [cited by applicant]
Ramesh Govindan et al., An Architecture for Stable, Analyzable Internet Routing, IEEE Network, vol. 13, issue 1, pp. 29-35, 1999. [cited by applicant]
Yang Chen et al., Optical Burst Switching: A New Area in Optical Networking Research, IEEE Network, vol. 18, issue 3, pp. 16-23, 2004. [cited by applicant]
Aten International Co., Ltd. KE6920 datasheet, ver. 01, Jun. 17, 2020, 1-5, https://assets.aten.com/product/spec_sheet/JP/ke6920-6922_ver01j.pdf, ATEN Product Information KE6920. [cited by applicant]
Takamichi Nishijima et al., On the Impact of Network Environment on Remote Desktop Protocols, IEICE Technical Report CQ2012-21 (Jul. 2012), 2012, pp. 23-28. [cited by applicant]
Bijoy Chand Chatterjee et al., Routing and Wavelength Assignment for WDM-based Optical Networks, Springer, pp. 35-43, vol. 410, 2017. [cited by applicant]
Wei Lu et al., Dynamic Service Provisioning of Advance Reservation Requests in Elastic Optical Networks, Journal of Lightwave Technology, vol. 31, Issue. 10, 2013, pp. 1621-1627. [cited by applicant]
M. Jinno et al., An Overview of Elastic Optical Networks, Proceedings of the 2013 IEICE Communications Society Conference, 2013, p. SS-98-SS-99. [cited by applicant]
Pegah Afsharlar et al., Routing and Spectrum Assignment with Delayed Allocation in Elastic Optical Networks, Journal of Optical Communications and Networking, 2017, pp. 1-10. [cited by applicant]
K. Yamaguchi et al., MXN Wavelength Selective Switches Using Beam Splitting By Space Light Modulators, IEEE Photonics Journal, vol. 8, No. 1, Feb. 2016. [cited by applicant]
R. A. Wagner and S. E. Dreyfus, The Steiner Problem in Graphs, Networks 1, Dreyfus and Wagner, pp. 195-207, 1972. [cited by applicant]
Y. Liu et al., The Degree-Constrained Multicasting Algorithm Using Ant Algorithm, Proceedings of the 10th International Conference on Telecommunications, 2003, pp. 370-374. [cited by applicant]
Ryan Shea and Jiangchuan Liu, Cloud Gaming: Architecture and Performance, IEEE Network • Jul./Aug. 2013, IEEE 2013, pp. 16-21. [cited by applicant]
International Search Report issued in PCT/JP2020/036303, mailed on Feb. 2, 2021. [cited by applicant]
International Search Report issued in PCT/JP2020/039655, mailed on Feb. 16, 2021. [cited by applicant]
“Masahiko Jinno, ”“Virtualization in Optical Networks from Network Level to Hardware Level [Invited]”“, Oct. 2013, Optical Society of America (Year: 2013)”. [cited by applicant]