Beyond the Min-Cut Bound: Deterministic Network Coding for Asynchronous Multirate Broadcast
Amy Fu, Parastoo Sadeghi, Muriel Medard

TL;DR
This paper introduces a deterministic network coding scheme for asynchronous multirate broadcast in erasure networks, surpassing min-cut limits and ensuring fair delivery without requiring receivers to know all transmitted packets.
Contribution
It presents a novel non-block-based deterministic coding method that exceeds traditional capacity bounds and operates efficiently with minimal receiver feedback.
Findings
Achieves multirate delivery beyond min-cut limits.
Provides a tractable estimation method for delivery rates.
Develops a fairness algorithm for resource allocation.
Abstract
In a single hop broadcast packet erasure network, we demonstrate that it is possible to provide multirate packet delivery outside of what is given by the network min-cut. This is achieved by using a deterministic non-block-based network coding scheme, which allows us to sidestep some of the limitations put in place by the block coding model used to determine the network capacity. Under the network coding scheme we outline, the sender is able to transmit network coded packets above the channel rate of some receivers, while ensuring that they still experience nonzero delivery rates. Interestingly, in this generalised form of asynchronous network coded broadcast, receivers are not required to obtain knowledge of all packets transmitted so far. Instead, causal feedback from the receivers about packet erasures is used by the sender to determine a network coded transmission that will allow…
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.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications
