首页> 外文期刊>IEEE/ACM Transactions on Networking >Optimal Submarine Cable Path Planning and Trunk-and-Branch Tree Network Topology Design
【24h】

Optimal Submarine Cable Path Planning and Trunk-and-Branch Tree Network Topology Design

机译:最佳潜艇电缆路径规划和Trunk-And Branch树网拓扑设计

获取原文
获取原文并翻译 | 示例

摘要

We study the path planning of submarine cable systems with trunk-and-branch tree topology on the surface of the earth. Existing work on path planning represents the earth's surface by triangulated manifolds and takes account of laying cost of the cable including material, labor, alternative protection levels, terrain slope and survivability of the cable. Survivability issues include the risk of future cable break associated with laying the cable through sensitive and risky areas, such as, in particular, earthquake-prone regions. The key novelty of this paper is an examination and solution of the path planning of submarine cable systems with trunk-and-branch tree topology. We formulate the problem as a Steiner minimal tree problem on irregular 2D manifolds in R-3 . For a given Steiner topology, we propose a polynomial time computational complexity numerical method based on the dynamic programming principle. If the topology is unknown, a branch and bound algorithm is adopted. Simulations are performed on real-world three-dimensional geographical data.
机译:我们研究了地球表面的中继和分支树拓扑结构的潜艇电缆系统的路径规划。路径规划的现有工作代表了Trigulated歧管的地球表面,并考虑了电缆的铺设成本,包括材料,劳动力,替代保护水平,地形坡度和电缆的生存性。生存能力问题包括通过敏感和风险区域铺设电缆的未来电缆断裂的风险,例如,特别是地震 - 易发的地区。本文的关键新颖性是具有Trunk-Branch树拓扑结构的潜艇电缆系统路径规划的检查和解决方案。在R-3中的不规则2D歧管上,我们将问题作为施蒂纳最小的树问题。对于给定的Steiner拓扑,我们提出了一种基于动态编程原理的多项式时间计算复杂性数值方法。如果拓扑未知,则采用分支和绑定算法。在现实世界的三维地理数据上进行模拟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号