Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network
- 8 March 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (7) , 4345-4360
Abstract
This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination with help of a relay. The source-to-relay and relay-to-destination links are unreliable and introduce at most N 1 and N 2 packet erasures, respectively. The destination node must recover each message packet within a strict delay constraint T . The paper presents a new construction of streaming codes for all feasible parameters { N 1 , N 2 , T }. Our work improves upon the construction in Fong et al. by adapting the relaying strategy based on the erasure patterns from source to relay. Specifically, the code employs the notion of symbol estimates, which allows the relay to forward information about symbols before it can decode that symbol, and variable-rate encoding, which decreases the rate used to encode a packet as more erasures affect that packet. The codes proposed in this paper achieve rates higher than the ones proposed by Fong et al. whenever N 2 > N 1 , and achieve the same rate when N 2 ≤ N 1 , in which case the rate is optimal. The paper also presents an upper bound on the achievable rate that takes into account erasures in both links in order to bound the rate in the second link. The upper bound is shown to be tighter than a trivial bound that considers only the erasures in the second link.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Latency and Cybersickness: Impact, Causes, and Measures. A ReviewFrontiers in Virtual Reality, 2020
- Adaptive Causal Network Coding with Feedback for Multipath Multi-hop CommunicationsIEEE Transactions on Communications, 2020
- Rate-Optimal Streaming Codes for Channels With Burst and Random ErasuresIEEE Transactions on Information Theory, 2020
- Optimal Streaming Codes for Channels With Burst and Arbitrary ErasuresIEEE Transactions on Information Theory, 2019
- Design of FEC for Low Delay in 5GIEEE Journal on Selected Areas in Communications, 2017
- Burst-Erasure Correcting Codes with Optimal Average DelayIEEE Transactions on Information Theory, 2017
- Layered Constructions for Low-Delay Streaming CodesIEEE Transactions on Information Theory, 2016
- Gaming in the clouds: QoE and the users’ perspectiveMathematical and Computer Modelling, 2013
- Subjective Evaluation of Latency and Packet Loss in a Cloud-Based Game2013
- Burst Erasure Correction Codes With Low Decoding DelayIEEE Transactions on Information Theory, 2004