Optimal and heuristic network coding algorithms for multi‐layered video broadcast

In this article 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 pro...

Full description

Saved in:
Bibliographic Details
Published inNetworks Vol. 71; no. 1; pp. 51 - 59
Main Authors Bérczi‐Kovács, Erika R., Király, Zoltán
Format Journal Article
LanguageEnglish
Published New York Wiley Subscription Services, Inc 01.01.2018
Subjects
Algorithms
Coding
Multilayers
multi‐layered video streaming
network coding
Video broadcasting
Video communication
Video transmission
Online AccessGet full text
ISSN0028-3045
1097-0037
DOI10.1002/net.21788

Cover

More Information
Summary:In this article 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. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(1), 51–59 2018
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0028-3045
1097-0037
DOI:10.1002/net.21788