Selection of network coding nodes for minimal playback delay in streaming overlays
Nicolae Cleju, Nikolaos Thomos, and Pascal Frossard

TL;DR
This paper proposes efficient algorithms for selecting network coding nodes in streaming overlays to minimize decoding delay and maximize throughput, demonstrating significant performance improvements in realistic simulations.
Contribution
It introduces two algorithms for selecting network coding nodes, one using full network statistics and the other using only local info, achieving near-optimal performance in distributed settings.
Findings
Significant throughput and delay improvements over traditional methods.
Distributed node selection performs close to centralized strategies.
Large gains in video quality in realistic overlay network simulations.
Abstract
Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. We address here the effective placement of nodes that implement randomized network coding in overlay networks, so that the goodput is kept high while the delay for decoding stays small in streaming applications. We first estimate the decoding delay at each client, which depends on the innovative rate in the network. This estimation permits to identify the nodes that have to perform coding for a reduced decoding delay. We then propose two iterative algorithms for selecting the nodes that should perform network coding. The first algorithm relies on the knowledge of the full network statistics. The second algorithm uses only local network…
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.
