利用系统随机码提高可靠传输吞吐量

Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong
{"title":"利用系统随机码提高可靠传输吞吐量","authors":"Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong","doi":"10.1109/LCN.2016.87","DOIUrl":null,"url":null,"abstract":"Rateless erasure code (REC) is an erasure code, where the encoder generates a potentially infinite number of encoded symbols and the original message can be reconstructed from a sufficient number of correctly received packets. Many REC-based transmission protocols have been proposed for improving network throughput in lossy channel. However, state-of-the-art RECs (such as LT code and Raptor code) are not efficient for transmitting short messages. Recent studies suggest that network traffic is characterised by bursts of short messages and thus existing transmission protocols do not benefit from the gains of deploying REC. In this paper, we propose an REC-based transmission protocol, namely UDP-RC, which integrates the simplicity of UDP and strength of systematic Random code suited to network traffic with short messages. It attains high throughput by transmitting short messages reliably with lower overheads over lossy channel. We experimentally show that UDP-RC achieves at least 50% higher throughput and maintains more stable throughput compared to TCP (Transmission Control Protocol) and UDT (UDP Data transfer) protocol under both ideal and lossy channel conditions.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"610 1","pages":"539-542"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improving Reliable Transmission Throughput with Systematic Random Code\",\"authors\":\"Zan-Kai Chong, H. Ohsaki, Cheng-Kuan Bryan Ng, B. Goi, H. Ewe, S. Chong\",\"doi\":\"10.1109/LCN.2016.87\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rateless erasure code (REC) is an erasure code, where the encoder generates a potentially infinite number of encoded symbols and the original message can be reconstructed from a sufficient number of correctly received packets. Many REC-based transmission protocols have been proposed for improving network throughput in lossy channel. However, state-of-the-art RECs (such as LT code and Raptor code) are not efficient for transmitting short messages. Recent studies suggest that network traffic is characterised by bursts of short messages and thus existing transmission protocols do not benefit from the gains of deploying REC. In this paper, we propose an REC-based transmission protocol, namely UDP-RC, which integrates the simplicity of UDP and strength of systematic Random code suited to network traffic with short messages. It attains high throughput by transmitting short messages reliably with lower overheads over lossy channel. We experimentally show that UDP-RC achieves at least 50% higher throughput and maintains more stable throughput compared to TCP (Transmission Control Protocol) and UDT (UDP Data transfer) protocol under both ideal and lossy channel conditions.\",\"PeriodicalId\":6864,\"journal\":{\"name\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"volume\":\"610 1\",\"pages\":\"539-542\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 41st Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2016.87\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.87","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

无速率擦除码(REC)是一种擦除码,其中编码器生成可能无限数量的编码符号,并且可以从足够数量的正确接收的数据包中重构原始消息。为了提高有损信道下的网络吞吐量,提出了许多基于recc的传输协议。然而,最先进的RECs(如LT代码和Raptor代码)在传输短消息时效率不高。最近的研究表明,网络流量的特征是短消息爆发,因此现有的传输协议不能从部署REC中获益。在本文中,我们提出了一种基于REC的传输协议,即UDP- rc,它集成了UDP的简单性和适合短消息网络流量的系统随机码的强度。它通过在有损信道上以较低的开销可靠地传输短消息来实现高吞吐量。实验表明,在理想和有损信道条件下,与TCP(传输控制协议)和UDT (UDP数据传输)协议相比,UDP- rc实现了至少50%的高吞吐量,并保持了更稳定的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving Reliable Transmission Throughput with Systematic Random Code
Rateless erasure code (REC) is an erasure code, where the encoder generates a potentially infinite number of encoded symbols and the original message can be reconstructed from a sufficient number of correctly received packets. Many REC-based transmission protocols have been proposed for improving network throughput in lossy channel. However, state-of-the-art RECs (such as LT code and Raptor code) are not efficient for transmitting short messages. Recent studies suggest that network traffic is characterised by bursts of short messages and thus existing transmission protocols do not benefit from the gains of deploying REC. In this paper, we propose an REC-based transmission protocol, namely UDP-RC, which integrates the simplicity of UDP and strength of systematic Random code suited to network traffic with short messages. It attains high throughput by transmitting short messages reliably with lower overheads over lossy channel. We experimentally show that UDP-RC achieves at least 50% higher throughput and maintains more stable throughput compared to TCP (Transmission Control Protocol) and UDT (UDP Data transfer) protocol under both ideal and lossy channel conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信