A hybrid scheme for instantaneous recovery route design with two different coding aware scenarios

Pham Vu Phong, A. H. Al Muktadir, E. Oki
{"title":"A hybrid scheme for instantaneous recovery route design with two different coding aware scenarios","authors":"Pham Vu Phong, A. H. Al Muktadir, E. Oki","doi":"10.1109/ICNIDC.2014.7000341","DOIUrl":null,"url":null,"abstract":"In order to reduce the required backup resources for 1+1 protection, while maintaining its instantaneous recovery advantage, two coding aware scenarios were presented, namely the traffic splitting (TS) scenario and the two sources and a common destination (2SD) scenario. Coding based 1+1 protection route design for all possible source destination pair by utilizing TS and 2SD scenarios, individually, were addressed in previous works. In those works about 15% (for 2SD) and 20% (for TS) resource saving were reported. In theory, maximum possible resource saving for 2SD scenarios is about 25% and that of for TS scenarios is about 50%. This paper proposes a hybrid scheme for coding based 1+1 protection route design for all possible source destination pairs, where the TS and 2SD scenarios are used intelligently according to the largest effective gain first policy. We evaluate our proposed scheme in several fixed network topologies. Numerical results observe that our scheme with both scenarios achieves about 26% resource saving, it is 7% higher than the worst cases when TS and 2SD scenarios are individually used in route design.","PeriodicalId":181478,"journal":{"name":"2014 4th IEEE International Conference on Network Infrastructure and Digital Content","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th IEEE International Conference on Network Infrastructure and Digital Content","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNIDC.2014.7000341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In order to reduce the required backup resources for 1+1 protection, while maintaining its instantaneous recovery advantage, two coding aware scenarios were presented, namely the traffic splitting (TS) scenario and the two sources and a common destination (2SD) scenario. Coding based 1+1 protection route design for all possible source destination pair by utilizing TS and 2SD scenarios, individually, were addressed in previous works. In those works about 15% (for 2SD) and 20% (for TS) resource saving were reported. In theory, maximum possible resource saving for 2SD scenarios is about 25% and that of for TS scenarios is about 50%. This paper proposes a hybrid scheme for coding based 1+1 protection route design for all possible source destination pairs, where the TS and 2SD scenarios are used intelligently according to the largest effective gain first policy. We evaluate our proposed scheme in several fixed network topologies. Numerical results observe that our scheme with both scenarios achieves about 26% resource saving, it is 7% higher than the worst cases when TS and 2SD scenarios are individually used in route design.
两种不同编码感知场景下瞬时恢复路由设计的混合方案
为了减少1+1保护所需的备份资源,同时保持其瞬时恢复优势,提出了两种编码感知场景,即流量分割(TS)场景和两源一共目的(2SD)场景。基于编码的1+1保护路由设计,利用TS和2SD方案,为所有可能的源目的地对,分别在以前的工作中解决。在这些工作中,约有15% (2SD)和20% (TS)的资源节约。理论上,2SD场景的最大可能资源节省约为25%,TS场景的最大可能资源节省约为50%。本文提出了一种基于编码的混合方案,针对所有可能的源、目的对进行1+1保护路由设计,根据最大有效增益优先策略,智能地使用TS和2SD场景。我们在几种固定网络拓扑中评估了我们提出的方案。数值结果表明,我们的方案在两种场景下均实现了约26%的资源节约,比单独使用TS和2SD场景进行路由设计的最坏情况提高了7%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书