...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computer Communications >A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection
【24h】

A Bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection

机译：具有专用保护的WDM光网络中的路由和网络编码分配问题的双目标整数线性规划模型

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The explosive traffic growths are pushing the transport network close to its capacity limitation, raising critical issues about fiber capacity crunch. In this context, network coding has been emerging as the promising technique to improve the network capacity efficiency thanks to the capability of better resources utilization. The application of network coding to the realms of failure recovery in optical networks has paved the new way for more efficient protection schemes and indeed, XOR network coding combined with dedicated protection has been proposed, investigated and developed to challenge the well-established understanding of trading capacity efficiency for recovery speed and vice versa. In order to maximize the benefits empowered by network coding in this case, the problem of 1 + 1 routing and network coding assignment (1 + 1 RNCA) has to be optimally solved. Apart from traditional 1 + 1 routing, the decision of network coding information has also to be taken into account including the selection of pair of demands for encoding and the respective coding node and coding links. In this paper, we propose a bi-objective integer linear programming model of the 1 + 1 RNCA problem aiming at minimizing the conventional routing cost as the primary objective and furthermore minimizing the number of nodes with coding capabilities as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide a rigorous analysis on configuring the weight coefficients to capture the desired priority of individual objectives. The efficiency of our integrated objective model in comparison with reference designs based on the single-objective model, 1 + 1 routing and 1 + 1 RNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation demonstrates that our proposal outperforms traditional approaches when it could achieve the lowest routing cost while simultaneously employing minimal number of coding nodes, albeit with a slightly higher computation time. We furthermore provide a parametric study on the impact of number of coding nodes to the achievable routing cost improvement and it turns out that having two coding nodes is already sufficient to realize most of the benefits enabled by network coding.
机译：爆炸性的流量增长使传输网络接近其容量极限，引发了有关光纤容量紧缩的关键问题。在这种情况下，由于具有更好的资源利用能力，网络编码已成为提高网络容量效率的有前途的技术。网络编码在光网络故障恢复领域的应用为更有效的保护方案铺平了道路，事实上，已经提出，研究和开发了将XOR网络编码与专用保护结合起来，以挑战对交易的公认理解。恢复速度的容量效率，反之亦然。为了在这种情况下最大程度地提高网络编码带来的利益，必须最佳地解决1 + 1路由和网络编码分配（1 + 1 RNCA）的问题。除了传统的1 + 1路由之外，还必须考虑网络编码信息的决策，包括选择编码需求对以及相应的编码节点和编码链接。在本文中，我们提出了一个1 + 1 RNCA问题的双目标整数线性规划模型，旨在最小化传统路由成本作为主要目标，并进一步最小化以编码能力作为次要目标的节点数量。我们的公式使用权重方法将两个目标组合为一个综合目标，并且我们对配置权重系数进行了严格的分析，以捕获各个目标的期望优先级。与基于单目标模型，1 +1路由和1 +1 RNCA的参考设计相比，我们的集成目标模型的效率在不同的实际拓扑和流量集上进行了数值评估。广泛的仿真表明，我们的建议可以达到最低的路由成本，同时使用最少数量的编码节点，尽管其计算时间稍长，但其性能优于传统方法。我们还提供了一个关于编码节点数量对可实现的路由成本提高的影响的参数研究，结果发现拥有两个编码节点已经足以实现网络编码带来的大多数好处。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号