Tiny Codes for Guaranteeable Delay
Derya Malak, Muriel M\'edard, Edmund M. Yeh

TL;DR
This paper introduces tiny codes and new ARQ protocols to improve delay guarantees and throughput in 5G ultra-reliable low-latency communications, especially under unreliable feedback conditions.
Contribution
It proposes the use of tiny sliding window codes and designs three variations of selective-repeat ARQ protocols to enhance delay guarantees and throughput in wireless erasure links.
Findings
Coded ARQ achieves up to 40% throughput gains.
Coded ARQ provides delay guarantees and robustness.
Hybrid ARQ offers slight throughput improvement.
Abstract
Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of guaranteeable delay which is the average delay plus three standard deviations of the mean. We investigate the trade-off between guaranteeable delay and throughput for point-to-point wireless erasure links with unreliable and delayed feedback, by bringing together signal flow techniques to the area of coding. We use tiny codes, i.e. sliding window by coding with just 2 packets, and design three variations of selective-repeat ARQ protocols, by building on the baseline scheme, i.e. uncoded ARQ, developed by Ausavapattanakun and Nosratinia: (i) Hybrid ARQ with soft combining at the receiver; (ii) cumulative feedback-based ARQ without rate adaptation; and (iii)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
