A feedback-based adaptive broadcast coding scheme for reducing in-order delivery delay

Abstract

We propose a new feedback-based adaptive coding scheme for a packet erasure broadcast channel. The main performance metric of interest is the delay. We consider two types of delay - decoding delay and delivery delay. Decoding delay is the time difference between the instant when the packet is decoded at an arbitrary receiver and the instant when it arrived at the sender. Delivery delay also includes the period when a decoded packet waits in a resequencing buffer at the receiver until all previous packets have also been decoded. This notion of delay is motivated by applications that accept packets only in order. Our coding scheme has the innovation guarantee property and is hence throughput optimal. It also allows efficient queue management. It uses the simple strategy of mixing only the oldest undecoded packet of each receiver, and therefore extends to any number of receivers. We conjecture that this scheme achieves the asymptotically optimal delivery (and hence decoding) delay. The asymptotic behavior is studied in the limit as the load factor of the system approaches capacity. This conjecture is verified through simulations.