• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Communications >A heuristic routing algorithm with erasure correcting code based instantaneous recovery technique
【24h】

A heuristic routing algorithm with erasure correcting code based instantaneous recovery technique

机译：一种基于纠删码的瞬时恢复启发式路由算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper proposes a heuristic routing algorithm to design routes for all possible source destination pairs by provisioning erasure correcting code based instantaneous recovery technique with optimal traffic splitting, which was addressed for a source destination pair in a prior work. We consider a static routing problem in networks having the coding capability. When the links in a network have finite capacities, assigning routing for all possible source destination pair by using this instantaneous recovery technique are mutually dependent, and this issue was not addressed. For the route designing purpose, one need to check routing for exponential number of traffic splitting number combinations. If the number of combinations to be considered, which equals the multiplication of each individual maximum possible traffic splitting numbers of all pairs considered, becomes extremely large obtaining a routing solution within a practical time is not possible. In order to achieve a routing solution within a practical time, the proposed heuristic algorithm gives highest priority to the pair either with the largest cost or with the largest resource saving effect. For all source destination pairs the total path costs of implementing erasure correcting code based instantaneous recovery technique, and conventional 1+1 protection technique are computed. Almost 20% resource saving w.r.to 1+1 protection is achieved in our examined networks.
机译：本文提出了一种启发式路由算法，通过提供基于擦除校正代码的即时恢复技术和最佳流量分割来设计所有可能的源目的地对的路由，这在先前的工作中已针对该问题进行了解决。我们考虑具有编码能力的网络中的静态路由问题。当网络中的链路具有有限的容量时，使用此瞬时恢复技术为所有可能的源目标对分配路由是相互依赖的，因此未解决此问题。出于路由设计的目的，需要检查路由以了解流量分割数量组合的指数数量。如果要考虑的组合的数量等于所考虑的所有对的每个单独的最大可能的流量分割数量的乘积，则变得非常大，那么在实际时间内不可能获得路由解决方案。为了在实际时间内实现路由解决方案，所提出的启发式算法以最大的代价或最大的资源节省效果为该对提供最高的优先级。对于所有源目的地对，计算实现基于纠删码的瞬时恢复技术和常规1 + 1保护技术的总路径成本。在我们检查的网络中，将Warr to 1 + 1保护几乎节省了20％的资源。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号