TY - JOUR
T1 - On Streaming Coding for Low-Latency Packet Transmissions over Highly Lossy Links
AU - Li, Ye
AU - Zhang, Feifan
AU - Wang, Jue
AU - Quek, Tony Q.S.
AU - Wang, Jiangzhou
N1 - Funding Information:
Manuscript received March 25, 2020; revised April 14, 2020; accepted April 19, 2020. Date of publication April 21, 2020; date of current version September 12, 2020. The work was supported by National Natural Science Foundation of China (NSFC) under Grant no. 61801248, 61771263, 61771264, 61871241, by Natural Science Foundation of Jiangsu under Grant BK20180943, and by Natural Science Foundation of the Jiangsu Higher Education Institutes under Grant no. 18KJB510036. The work of Ye Li and Jue Wang was supported by the project “The Verification Platform of Multi-tier Coverage Communication Network for Oceans (LZC0020)”. The associate editor coordinating the review of this letter and approving it for publication was M.-R. Sadeghi. (Corresponding author: Jue Wang.) Ye Li and Jue Wang are with the School of Information Science and Technology, Nantong University, Nantong 226019, China, also with the Peng Cheng Laboratory, Shenzhen 518066, China, and also with the Nantong Research Institute for Advanced Communication Technology, Nantong 226019, China (e-mail: yeli@ntu.edu.cn; wangjue@ntu.edu.cn).
Publisher Copyright:
© 1997-2012 IEEE.
PY - 2020/9
Y1 - 2020/9
N2 - This letter investigates streaming coding that places multiple repair packets between source packets to achieve in-order delivery over highly lossy links. While directly analyzing the deterministic placement of repair packets is difficult, a tractable random model is proposed and analyzed to show that a finite in-order delay is achieved. Using it as a guide of the insertion percentage, the delay is then shown to be further reducible by uniformly placing the repair packets, which suppresses the random variation.
AB - This letter investigates streaming coding that places multiple repair packets between source packets to achieve in-order delivery over highly lossy links. While directly analyzing the deterministic placement of repair packets is difficult, a tractable random model is proposed and analyzed to show that a finite in-order delay is achieved. Using it as a guide of the insertion percentage, the delay is then shown to be further reducible by uniformly placing the repair packets, which suppresses the random variation.
UR - http://www.scopus.com/inward/record.url?scp=85091180127&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091180127&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2020.2989367
DO - 10.1109/LCOMM.2020.2989367
M3 - Article
AN - SCOPUS:85091180127
SN - 1089-7798
VL - 24
SP - 1885
EP - 1889
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 9
M1 - 9075270
ER -