4.6 Article

An Optimal Design Framework for 1+1 Routing and Network Coding Assignment Problemin WDM Optical Networks

期刊

IEEE ACCESS
卷 5, 期 -, 页码 22291-22298

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2017.2761809

关键词

Routing; network coding; dedicated protection; optical networks; integer linear programming; network optimization

资金

  1. Vietnam's National Foundation for Science and Technology Development
  2. Hanoi University of Industry

向作者/读者索取更多资源

Network coding (NC) features a new perspective for leveraging network performances as more efficient resources utilization could be achieved. In recent years, the application of NC to the realms of failure recovery in optical networks has been receiving growing attention and indeed, combining the nearinstantaneous recovery of dedicated protection and improved capacity efficiency enabled by NC constitutes an important research trend in optical protection. In order to maximize the bene fits empowered by NC, a critical problem on routing of traffic demands, selecting demands for encoding and determining the respective coding node and coding links has to be optimally addressed. The problem becomes even more challenging if multiple traffic demands are considered at once and the traffic is non-equal. In addressing those issues, for the first time, we present a novel unified framework for augmenting 1 + 1 dedicated protection against single link failures with a practical network coding scheme based on XOR operation for both equal and non-equal traffic scenarios. In line with this framework, a mathematical model in the form of integer linear programming for optimal routing and network coding assignment to minimize the path cost is presented. Numerical results based on evaluating the model on realistic topologies and all-to-one traffic setting highlight the cost advantages of our proposed NC-assisted protection scheme compared to traditional counterparts.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据