首页> 外文会议>International Conference on Intelligent Networking and Collaborative Systems >Network Design Problem by Link Protection to Keep Small Increase of Path Length during Link Failures
【24h】

Network Design Problem by Link Protection to Keep Small Increase of Path Length during Link Failures

机译:链路保护引起的网络设计问题,以在链路故障期间使路径长度保持很小的增长

获取原文

摘要

Many actual networks face the risk that the quality of service drastically degrades when the length of paths increases by link failure. To get rid of this risk, it is necessary to design a network so that the maximum increase ratio of path length by link failure is small for all paths. Therefore, the critical links whose failures significantly degrade the performance must be protected by rapid recovery so that the failures cannot be detected over the IP layer. The number of protected links must be small to restrict the investment cost for facilities and operational cost for Internet service providers. In this paper, we formulate this link protection problem and prove that the problem is NP-hard. In addition, we propose a polynomial-time algorithm to solve the problem that the number of simultaneous link failures is restricted to one.
机译:当路径长度因链路故障而增加时,许多实际的网络都面临着服务质量急剧下降的风险。为了消除这种风险,必须设计一个网络,以使对于所有路径而言,由于链路故障而导致的路径长度的最大增加率较小。因此,必须通过快速恢复来保护其故障严重降低性能的关键链路,以便无法在IP层上检测到故障。受保护的链接的数量必须很小,以限制设施的投资成本和Internet服务提供商的运营成本。在本文中,我们制定了此链路保护问题,并证明了该问题是NP困难的。另外,我们提出了多项式时间算法来解决同时发生的链路故障数量限制为一个的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号