IP Library › Granted Patent US 12,500,817
Granted Patent B2
US 12,500,817 · App. 18/454,249 · Granted Dec 16, 2025

System and a method for optimizing a cable system in a telecommunication network

Inventors: Tianjiao Wang (Pak Shek Kok, HK); Moshe Zukerman (Pak Shek Kok, HK); Bill Moran (Pak Shek Kok, HK)
H04L41/12H04L41/5003
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,500,817
App. No.
18/454,249
Granted
Dec 16, 2025
Kind
B2
Abstract

A system and a method for optimizing a cable system in a telecommunication network Includes the steps of: receiving a position of each of a plurality of terminal nodes and a minimum bandwidth requirement associated with an operation of the telecommunication network including the plurality of terminal nodes and a plurality of branching nodes, wherein the telecommunication network is arranged to facilitate communication among the plurality of terminal nodes via at least one of the plurality of branching nodes; determining, between adjacent pairs of nodes of terminal nodes or branching nodes, a distance and a bandwidth capacity of a cable edge between each adjacent pair; and providing an optimized geographical location of the branching nodes and an optimized bandwidth capacity of each cable edge in which the telecommunication network being deployed with the branching nodes and the cable edges meets a quality of service associated with the minimum bandwidth requirement.

Claims (29)

1 . A system for optimizing a cable system in a submarine cable network which comprises a plurality of submarine cables with different cable specifications, the system comprising:

a processing module arranged to:

determine a distance based on a position of each of a plurality of terminal nodes;

receive data defining the plurality of submarine cables with different cable specifications, wherein each cable specification includes a specific bandwidth capacity and an associated cost per unit length; and

determine, for each potential cable edge between adjacent pairs of nodes of the plurality of terminal nodes or a plurality of branching nodes provided in the submarine cable network, a set of possible edge weights based on the associated cost per unit length for each of the different cable specifications,

wherein the submarine cable network is arranged to facilitate communication among the plurality of terminal nodes via at least one of the plurality of branching nodes; and an optimization module arranged to, using a weighted edges Steiner minimum tree process that considers the set of possible edge weights:

provide an optimized geographical location of the branching nodes, wherein the optimized geographical locations are positions of Steiner nodes; and

select, for each cable edge in the submarine cable network being deployed, an optimized submarine cable from the plurality of submarine cables with different cable specifications, thereby providing an optimized bandwidth capacity for the cable edge, in which the submarine cable network being deployed with the branching nodes at the positions of Steiner nodes and the selected optimized submarine cables for the cable edges meets a quality of service (QOS) requirement associated with a minimum bandwidth requirement associated with an operation of the submarine cable network.

2 . The system in accordance with claim 1 , wherein the optimization module is arranged to determine the optimized geographical locations of the plurality of branching nodes and cable paths connecting the branching nodes in a subnetwork connecting the plurality of terminal nodes.

3 . The system in accordance with claim 2 , wherein the processing module is arranged to compose a subtree of Steiner nodes connected by connecting edges, wherein the subtree is arranged to connect with the plurality of terminal nodes in a skeleton tree.

4 . The system in accordance with claim 3 , wherein the processing module is further arranged to solve a dynamic programming problem associated with an optimization problem for a total cost of the physical cable network formed by the cable edges in the telecommunication network to determine a minimum cumulative cost of the cable edge and the branching nodes.

5 . The system in accordance with claim 2 , wherein the optimization module is further arranged to determine the optimized geographical locations of the plurality of branching nodes and cable paths based on additional attributes associated with a deployment of the telecommunication network and/or the maintenance of the telecommunication network after deployment.

6 . The system in accordance with claim 5 , wherein the additional attributes includes at least one of laying cost of the submarine cables, repair rates of the branching nodes or the submarine cables and cable paths based on geodesics.

7 . The system in accordance with claim 6 , wherein the optimization module is further arranged to shorten the cable edge with highest capacity than other cable edges within the telecommunication network thereby optimizing an efficiency of utilization of cable resources during the deployment of the telecommunication network.

8 . The method in accordance with claim 6 , wherein the repair rates of the branching nodes or the submarine cables are associated with earthquake-related cable damage risk and human activity-related risk at a predetermined geographical location.

9 . A method for optimizing a cable system in a submarine cable network comprising a plurality of submarine cables with different cable specifications, the method comprising the steps of:

receiving position data for each of a plurality of terminal nodes;

receiving data defining the plurality of submarine cables with different cable specifications, wherein each cable specification includes a specific bandwidth capacity and an associated cost per unit length;

receiving a minimum bandwidth requirement associated with an operation of the submarine cable network;

determining, by a processing module, for each potential cable edge between adjacent pairs of nodes of the plurality of terminal nodes or a plurality of branching nodes provided in the submarine cable network, a set of possible edge weights based on the associated cost per unit length for each of the different cable specifications, and determining a distance for the potential cable edges, wherein the submarine cable network is arranged to facilitate communication among the plurality of terminal nodes via at least one of the plurality of branching nodes; and

by using a weighted edges Steiner minimum tree process that considers the set of possible edge weights, providing an optimized geographical location of the branching nodes, wherein the optimized geographical locations are positions of Steiner nodes; and

selecting, for each cable edge in the submarine cable network being deployed, an optimized submarine cable from the plurality of submarine cables with different cable specifications, thereby providing an optimized bandwidth capacity for the cable edge, in which the submarine cable network being deployed with the branching nodes at the positions of Steiner nodes and the selected optimized submarine cables for the cable edges meets a quality of service (QOS) requirement associated with the minimum bandwidth requirement.

10 . The method in accordance with claim 9 , wherein the weighted edges Steiner minimum tree process comprises the step of the determining the optimized geographical locations of the plurality of branching nodes and cable paths connecting the branching nodes in a subnetwork connecting the plurality of terminal nodes.

11 . The method in accordance with claim 10 , wherein the step of determining the optimized geographical locations of the plurality of branching nodes comprising the step of composing a subtree of Steiner nodes connected by connecting edges, wherein the subtree is arranged to connect with the plurality of terminal nodes in a skeleton tree.

12 . The method in accordance with claim 11 , further comprising the step of solving a dynamic programming problem associated with an optimization problem for a total cost of the physical cable network formed by the cable edges in the telecommunication network to determine a minimum cumulative cost of the cable edge and the branching nodes.

13 . The method in accordance with claim 10 , further comprising the step of determining the optimized geographical locations of the plurality of branching nodes and cable paths based on additional attributes associated with a deployment of the telecommunication network and/or the maintenance of the telecommunication network after deployment.

14 . The method in accordance with claim 13 , wherein the additional attributes include at least one of laying cost of the submarine cables, repair rates of the branching nodes or the submarine cables and cable paths based on geodesics.

15 . The method in accordance with claim 14 , further comprising the step of shortening the cable edge with highest capacity than other cable edges within the telecommunication network thereby optimizing an efficiency of utilization of cable resources during the deployment of the telecommunication network.

16 . The method in accordance with claim 14 , wherein the repair rates of the branching nodes or the submarine cables are associated with earthquake-related cable damage risk and human activity-related risk at a predetermined geographical location.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2023
From: WANG, TIANJIAO; ZUKERMAN, MOSHE; MORAN, BILL
To: CENTRE FOR INTELLIGENT MULTIDIMENSIONAL DATA ANALYSIS LIMITED
Reel/Frame 064678/0325 →
Continuity (1)
Related Publication 20250071024A1 · Feb 27, 2025
References Cited (15)
US 6374202B1 · Robinson · 2002 [cited by examiner]
US 11228523B2 · Zukerman et al. · 2022 [cited by applicant]
US 11500125B2 · Zukerman et al. · 2022 [cited by applicant]
US 20130289966A1 · Forbes · 2013 [cited by examiner]
US 20150248461A1 · Theeten · 2015 [cited by examiner]
US 20200028746A1 · Zawadzki · 2020 [cited by examiner]
US 20200252327A1 · Zukerman · 2020 [cited by examiner]
US 20230118359A1 · Wang · 2023 [cited by examiner]
US 20230396506A1 · Wang · 2023 [cited by examiner]
Author: Wang et al. Title: Submarine Cable Network Design for Regional Connectivity Publisher: arxiv.org URL: https://arxiv.org/abs/2201.05802 (Year: 2022). [cited by examiner]
T. Wang, Z. Wang, B. Moran, et. al., “Latency-Aware Optimization of Submarine Communication Cable Systems with Trunk-and-Branch Topologies”, Journal of Lightwave Technology, vol. 40, No. 17, pp. 5825-5841, Sep. 2022. [cited by applicant]
T. Wang, Z. Wang, B. Moran, et. al., “Submarine Cable Network Design for Regional Connectivity”, IEEE/ACM Transactions on Networking, vol. 30, No. 6, pp. 2480-2492, Dec. 2022. [cited by applicant]
X. Wang, Z. Wang, E. Tahchi, et. al., “Submarine Cable Path Planning Based on Weight Selection of Design Considerations”, IEEE Access, vol. 9, pp. 123847-123860, Sep. 2021. [cited by applicant]
T. Wang, X. Wang, Z. Wang, et. al., “Optimal Tree Topology for a Submarine Cable Network With Constrained Internodal Latency,” Journal of Lightwave Technology, vol. 39, No. 9, pp. 2673-2683, May 2021. [cited by applicant]
Q. Wang, J. Guo, Z. Wang, et. al., “Cost-Effective Path Planning for Submarine Cable Network Extension,” IEEE Access, vol. 7, No. 1, pp. 61883-61895, May 2019. [cited by applicant]