SR ARQ通信中网络编码的吞吐量优势

Alaa Alsebae, M. Leeson, R. Green
{"title":"SR ARQ通信中网络编码的吞吐量优势","authors":"Alaa Alsebae, M. Leeson, R. Green","doi":"10.1109/CEEC.2013.6659443","DOIUrl":null,"url":null,"abstract":"Network coding can greatly influence the performance of flow control schemes. In this paper, the throughput of end-to-end Selective Repeat (SR) Automatic Repeat request (ARQ) of an intermediate communication link is investigated based on the Network Coding (NC) technique. Through MATLAB SimEvents® Simulink, we shall show that the throughput performance is sensitive to a number of the node incoming links and the available bandwidth at which the channel is operating. The throughput performance is studied as a function of the factor a, which represents the ratio of the propagation time to the packet transmission time. For a low bandwidth error-free unicast, NC showed a throughput improvement of between 100% and 400% when a is high, and between 1% and 5% for a low value of a, depending on the number of the incoming node links. In erroneous scenarios, the comparative results show that NC lends itself perfectly to fulfilling between 22% and 40% throughput achievement gain over the traditional SR ARQ for a small value of a and Packet Error Rate (PER) equal to 0.01. Furthermore, the improvement reaches between 47% and 153% if the channel is susceptible to a PER of 0.1.","PeriodicalId":309053,"journal":{"name":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The throughput benefits of network coding for SR ARQ communication\",\"authors\":\"Alaa Alsebae, M. Leeson, R. Green\",\"doi\":\"10.1109/CEEC.2013.6659443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network coding can greatly influence the performance of flow control schemes. In this paper, the throughput of end-to-end Selective Repeat (SR) Automatic Repeat request (ARQ) of an intermediate communication link is investigated based on the Network Coding (NC) technique. Through MATLAB SimEvents® Simulink, we shall show that the throughput performance is sensitive to a number of the node incoming links and the available bandwidth at which the channel is operating. The throughput performance is studied as a function of the factor a, which represents the ratio of the propagation time to the packet transmission time. For a low bandwidth error-free unicast, NC showed a throughput improvement of between 100% and 400% when a is high, and between 1% and 5% for a low value of a, depending on the number of the incoming node links. In erroneous scenarios, the comparative results show that NC lends itself perfectly to fulfilling between 22% and 40% throughput achievement gain over the traditional SR ARQ for a small value of a and Packet Error Rate (PER) equal to 0.01. Furthermore, the improvement reaches between 47% and 153% if the channel is susceptible to a PER of 0.1.\",\"PeriodicalId\":309053,\"journal\":{\"name\":\"2013 5th Computer Science and Electronic Engineering Conference (CEEC)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th Computer Science and Electronic Engineering Conference (CEEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEEC.2013.6659443\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th Computer Science and Electronic Engineering Conference (CEEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEEC.2013.6659443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

网络编码对流量控制方案的性能影响很大。研究了基于网络编码(NC)技术的中间通信链路端到端选择性重复(SR)自动重复请求(ARQ)的吞吐量。通过MATLAB SimEvents®Simulink,我们将显示吞吐量性能对多个节点传入链路和信道运行时的可用带宽非常敏感。研究了吞吐量性能作为因子a的函数,因子a表示传播时间与数据包传输时间的比率。对于低带宽无错误单播,当a较高时,NC的吞吐量提高在100%到400%之间,当a较低时,根据传入节点链路的数量,NC的吞吐量提高在1%到5%之间。在错误的情况下,比较结果表明,NC可以完美地实现比传统SR ARQ实现22%到40%的吞吐量增益,并且数据包错误率(PER)等于0.01。此外,如果通道易受0.1的PER影响,则改进幅度在47%到153%之间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The throughput benefits of network coding for SR ARQ communication
Network coding can greatly influence the performance of flow control schemes. In this paper, the throughput of end-to-end Selective Repeat (SR) Automatic Repeat request (ARQ) of an intermediate communication link is investigated based on the Network Coding (NC) technique. Through MATLAB SimEvents® Simulink, we shall show that the throughput performance is sensitive to a number of the node incoming links and the available bandwidth at which the channel is operating. The throughput performance is studied as a function of the factor a, which represents the ratio of the propagation time to the packet transmission time. For a low bandwidth error-free unicast, NC showed a throughput improvement of between 100% and 400% when a is high, and between 1% and 5% for a low value of a, depending on the number of the incoming node links. In erroneous scenarios, the comparative results show that NC lends itself perfectly to fulfilling between 22% and 40% throughput achievement gain over the traditional SR ARQ for a small value of a and Packet Error Rate (PER) equal to 0.01. Furthermore, the improvement reaches between 47% and 153% if the channel is susceptible to a PER of 0.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学术文献互助群
群 号:481959085
Book学术官方微信