Network Coding Algorithms for Multi-Layered Video Broadcast

TL;DR

This paper develops network coding algorithms for multi-layered video broadcast, addressing feasibility, complexity, and heuristic solutions for different layer scenarios in communication networks.

Contribution

It introduces polynomial algorithms for two layers, proves NP-hardness for three layers, and proposes a heuristic with experimental evaluation.

Findings

Polynomial-time feasibility algorithm for two layers

NP-hardness results for three layers

Heuristic approach with experimental comparison

Abstract

In this paper we give network coding algorithms for multi-layered video streaming. The problem is motivated by video broadcasting in a communication network to users with varying demands. We give a polynomial time algorithm for deciding feasibility for the case of two layers, and show that the problem becomes NP-hard if the task is to maximize the number of satisfied demands. For the case of three layers we also show NP-hardness of the problem. Finally, we propose a heuristic for three layers and give experimental comparison with previous approaches.