Adaptive relaying for streaming erasure codes in a three node relay network

by   Gustavo Kasper Facenda, et al.

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 through 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 achievable streaming codes for all feasible parameters {N_1, N_2, T} that exploit the fact that the relay naturally observes the erasure pattern occurring in the link from source to relay, thus it can adapt its relaying strategy based on these observations. In a recent work, Fong et al. provide streaming codes featuring channel-state-independent relaying strategies. 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. 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.


page 1

page 2

page 3

page 4


Optimal Streaming Erasure Codes over the Three-Node Relay Network

This paper investigates low-latency streaming codes for a three-node rel...

Error-correcting codes for low latency streaming over multiple link relay networks

This paper investigates the performance of streaming codes in low-latenc...

Streaming Erasure Codes over Multi-hop Relay Network

This paper studies low-latency streaming codes for the multi-hop network...

Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network

In this paper, we study the three-node Decode-and-Forward (D F) relay ...

Information Bottleneck for an Oblivious Relay with Channel State Information: the Vector Case

This paper considers the information bottleneck (IB) problem of a Raylei...

Distributed Information Bottleneck for a Primitive Gaussian Diamond Channel with Rayleigh Fading

This paper considers the distributed information bottleneck (D-IB) probl...

Streaming Erasure Codes over the Multiple Access Relay Channel

Applications where multiple users communicate with a common server and d...

Please sign up or login with your details

Forgot password? Click here to reset