Abstract: The present invention provides a cable network planning method comprising: modelling the prespecified topology as a Steiner tree including a plurality of terminal nodes representing a plurality of cable landing stations (CLSs) to be installed respectively in a plurality of destination regions connected by the cable network, a plurality of Steiner nodes presenting a plurality of branching units (BUs) to be installed in the cable network, and a plurality of edges connecting the terminal nodes and Steiner nodes; constructing a directed acyclic graph (DAG); finding a Steiner minimal tree (SMT) by applying a DAG-Least-Cost-System algorithm; returning coordinates of Steiner nodes, terminal nodes of the SMT as locations of the BUs and the CLSs. The provided method enables inclusion of costs of the Steiner nodes by taking account of Steiner nodes with degree in excess of three such that more flexible BU branching structures and CLS locations alternatives can be considered.

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.

Abstract: A method for determining optimal path arrangements for an infrastructure link between two geographic locations. The method includes modelling a geographic terrain containing the two geographic locations; optimizing an arrangement cost and a repair rate for two or more potential paths based on the modelled geographic terrain, an arrangement cost model, and a repair rate model, taking into account at least two design levels; and determining the optimal path arrangements each including multiple path portions and respective design levels associated with the path portions based on the optimization.

Abstract: A computer-implemented method for determining a path arrangement of an infrastructure link network with a trunk-and-branch topology. The method includes: modelling a geographic terrain including three or more geographic locations that are connectable with each other via an infrastructure link network; determining a cost function associated with a cost for constructing the infrastructure link network that connects the three or more geographic locations; and determining a path arrangement of the infrastructure link network based on the modelled geographic terrain and by optimizing the cost function taking into account one or more constraints. The path arrangement of the infrastructure link network has a trunk-and-branch topology and includes: three or more infrastructure links that connect the three or more geographic locations, and one or more connection points each arranged between two or more of the infrastructure links.

Abstract: A method for determining optimal path arrangements for an infrastructure link between two geographic locations, in particular, in uneven terrain. The method includes modelling a geographic terrain containing the two geographic locations; optimizing an arrangement cost and a repair rate for two or more potential paths based on the modelled geographic terrain, an arrangement cost model, and a repair rate model, taking into account at least two design levels, wherein the arrangement cost model incorporates direction-dependent factor and direction-independent factor associated with the path arrangements; and determining the optimal path arrangements each including multiple path portions and respective design levels associated with the path portions based on the optimization.

Abstract: The present invention provides a cable network planning method comprising: modelling the prespecified topology as a Steiner tree including a plurality of terminal nodes representing a plurality of cable landing stations (CLSs) to be installed respectively in a plurality of destination regions connected by the cable network, a plurality of Steiner nodes presenting a plurality of branching units (BUs) to be installed in the cable network, and a plurality of edges connecting the terminal nodes and Steiner nodes; constructing a directed acyclic graph (DAG); finding a Steiner minimal tree (SMT) by applying a DAG-Least-Cost-System algorithm; returning coordinates of Steiner nodes, terminal nodes of the SMT as locations of the BUs and the CLSs. The provided method enables inclusion of costs of the Steiner nodes by taking account of Steiner nodes with degree in excess of three such that more flexible BU branching structures and CLS locations alternatives can be considered.

Abstract: A method for determining optimal path arrangements for an infrastructure link between two geographic locations, in particular, in uneven terrain. The method includes modelling a geographic terrain containing the two geographic locations; optimizing an arrangement cost and a repair rate for two or more potential paths based on the modelled geographic terrain, an arrangement cost model, and a repair rate model, taking into account at least two design levels, wherein the arrangement cost model incorporates direction-dependent factor and direction-independent factor associated with the path arrangements; and determining the optimal path arrangements each including multiple path portions and respective design levels associated with the path portions based on the optimization.

Abstract: A method for determining optimal path arrangements for an infrastructure link between two geographic locations. The method includes modelling a geographic terrain containing the two geographic locations; optimizing an arrangement cost and a repair rate for two or more potential paths based on the modelled geographic terrain, an arrangement cost model, and a repair rate model, taking into account at least two design levels; and determining the optimal path arrangements each including multiple path portions and respective design levels associated with the path portions based on the optimization.