Network Coding Algorithms for Multi-Layered Video Broadcast

12/18/2017
by   Erika R. Bérczi-Kovács, et al.
0

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.

READ FULL TEXT
research
02/23/2023

Simultaneous Drawing of Layered Trees

We study the crossing minimization problem in a layered graph drawing of...
research
05/13/2022

Swift: Adaptive Video Streaming with Layered Neural Codecs

Layered video coding compresses video segments into layers (additional ...
research
05/25/2022

Transitions from P to NP-hardness: the case of the Linear Ordering Problem

In this paper we evaluate how constructive heuristics degrade when a pro...
research
08/12/2020

On the complexity of finding a local minimizer of a quadratic function over a polytope

We show that unless P=NP, there cannot be a polynomial-time algorithm th...
research
05/24/2023

Multi-Connectivity for Multicast Video Streaming in Cellular Networks (Extended Abstract)

In video streaming applications especially during live streaming events ...
research
06/01/2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns

Continuing results from JCDCGGG 2016 and 2017, we solve several new case...
research
01/19/2019

Computing Optimal Tangles Faster

We study the following combinatorial problem. Given a set of n y-monoton...

Please sign up or login with your details

Forgot password? Click here to reset