Piece selection algorithms for layered video streaming in P2P networks

Authors:
Tibor Szkaliczki;Michael Eberhard;Hermann Hellwagner;László Szobonya
Affiliations:
-;-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 8
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Online computation and competitive analysis

Online computation and competitive analysis
Heuristic and exact algorithms for the precedence-constrained knapsack problem

Journal of Optimization Theory and Applications
Hard multidimensional multiple choice knapsack problems, an empirical study

Computers and Operations Research
An improved strategy of piece selection in P2P

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Subjective impression of variations in layer encoded videos

IWQoS'03 Proceedings of the 11th international conference on Quality of service
Knapsack problem-based piece-picking algorithms for layered content in peer-to-peer networks

Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Overview of the Scalable Video Coding Extension of the H.264/AVC Standard

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper introduces the piece selection problem that arises when streaming layered video content over peer-to-peer networks. The piece selection algorithm decides periodically which pieces to request from other peers (network nodes) for download. The main goal of the piece selection algorithm is to provide the best possible quality for the available bandwidth. Our recommended solution approaches are related to the knapsack problem. In this paper, a number of layered piece picking algorithms are presented and they are compared to each other. In a competitive analysis, the presented online algorithms are compared to an optimal offline algorithm.