Link failure recovery in large arbitrary networks via network coding

Serhat Nazim Avci, E. Ayanoglu
{"title":"Link failure recovery in large arbitrary networks via network coding","authors":"Serhat Nazim Avci, E. Ayanoglu","doi":"10.1109/ITA.2014.6804248","DOIUrl":null,"url":null,"abstract":"Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. In this paper, we propose a simple column generation-based design algorithm and a novel advanced diversity (network) coding technique to achieve near-hitless recovery in large networks. The main problem is solved with Linear Programming (LP) and Integer Linear Programming (ILP), whereas the subproblem can be solved with different methods. Simulation results suggest that both the novel coding structure and the novel design algorithm lead to higher capacity efficiency for near-hitless recovery. The novel design algorithm simplifies the capacity placement problem which enables implementing diversity coding-based techniques in large networks with arbitrary topology.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Information Theory and Applications Workshop (ITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2014.6804248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. In this paper, we propose a simple column generation-based design algorithm and a novel advanced diversity (network) coding technique to achieve near-hitless recovery in large networks. The main problem is solved with Linear Programming (LP) and Integer Linear Programming (ILP), whereas the subproblem can be solved with different methods. Simulation results suggest that both the novel coding structure and the novel design algorithm lead to higher capacity efficiency for near-hitless recovery. The novel design algorithm simplifies the capacity placement problem which enables implementing diversity coding-based techniques in large networks with arbitrary topology.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于网络编码的大型任意网络链路故障恢复
基于网络编码的链路故障恢复技术提供了近乎无故障的恢复,并提供了高容量效率。在本文中,我们提出了一种简单的基于列生成的设计算法和一种新颖的先进的分集(网络)编码技术,以实现大型网络中的近无命中恢复。主要问题用线性规划(LP)和整数线性规划(ILP)求解,子问题可以用不同的方法求解。仿真结果表明,新的编码结构和设计算法都提高了近无命中恢复的容量效率。该算法简化了容量分配问题,使基于分集编码的技术能够在任意拓扑的大型网络中实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On code design for simultaneous energy and information transfer Distributed control for the smart grid: The case of economic dispatch Complexity reduced zero-forcing beamforming in massive MIMO systems Unconventional behavior of the noisy min-sum decoder over the binary symmetric channel Electromagnetic decoupling and complexity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1