Non-Asymptotic Analysis of Network Coding Delay

Maricica Nistor, R. Costa, T. Vinhoza, J. Barros
{"title":"Non-Asymptotic Analysis of Network Coding Delay","authors":"Maricica Nistor, R. Costa, T. Vinhoza, J. Barros","doi":"10.1109/NETCOD.2010.5487665","DOIUrl":null,"url":null,"abstract":"We present an expression for the delay distribution of Random Linear Network Coding over an erasure channel with a given loss probability. In contrast with previous contributions, our analysis is non- asymptotic in the sense that it is valid for any field size and any number of symbols. The results confirm that GF(16) already offers near-optimal decoding delay, whereas smaller field sizes (e.g. requiring only XOR operations) induce heavy tails in the delay distribution. A comparison with Automatic Repeat reQuest (ARQ) techniques (with perfect feedback) is also included.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Network Coding (NetCod)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2010.5487665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

We present an expression for the delay distribution of Random Linear Network Coding over an erasure channel with a given loss probability. In contrast with previous contributions, our analysis is non- asymptotic in the sense that it is valid for any field size and any number of symbols. The results confirm that GF(16) already offers near-optimal decoding delay, whereas smaller field sizes (e.g. requiring only XOR operations) induce heavy tails in the delay distribution. A comparison with Automatic Repeat reQuest (ARQ) techniques (with perfect feedback) is also included.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
网络编码延迟的非渐近分析
给出了随机线性网络编码在具有给定损失概率的擦除信道上的时延分布表达式。与以前的贡献相比,我们的分析是非渐近的,因为它对任何字段大小和任何数量的符号都有效。结果证实GF(16)已经提供了接近最佳的解码延迟,而较小的字段大小(例如只需要异或操作)会在延迟分布中引起重尾。并与具有完美反馈的自动重复请求(ARQ)技术进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Locating Byzantine Attackers in Intra-Session Network Coding Using SpaceMac Function Computation over Linear Channels Non-Asymptotic Analysis of Network Coding Delay Network Coding in Passive Optical Networks An Analytical Study of Network Coding in the Presence of Real-Time Messages
×
引用
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