CABLE NETWORK REGIONAL CONNECTIVITY PLANNING METHOD AND APPARATUS

    公开(公告)号:US20230118359A1

    公开(公告)日:2023-04-20

    申请号:US17502031

    申请日:2021-10-14

    摘要: 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.

    CABLE PATH PLANNING METHOD AND APPARATUS

    公开(公告)号:US20230061400A1

    公开(公告)日:2023-03-02

    申请号:US17411093

    申请日:2021-08-25

    IPC分类号: H04L12/24 H04L12/733

    摘要: The present invention provides a cable planning method based a fast marching method applied with simulated annealing (FMM/SA) algorithm. In the FMM/SA algorithm-based cable planning method, the FMM used to obtain the optimal submarine cable path with the lowest life-cycle cost, and the SA algorithm is used to continuously adjust the weight of each design consideration with the aim to achieve an optimal cable path that is as close as possible to a real-life cable path which has a history of cost-effectiveness and resilience. The set of weights contributed to the optimal cable path is then used as an optimal set of weights of design considerations for cable path planning. The FMM/SA algorithm-based cable planning method can provide a computationally effective approach which has lower computation costs and better performance in generating cable paths with optimal life-cycle cost and reliability.