Knapsack problem-based piece-picking algorithms for layered content in peer-to-peer networks

Authors:
Michael Eberhard;Tibor Szkaliczki;Hermann Hellwagner;László Szobonya;Christian Timmerer
Affiliations:
Klagenfurt University, Klagenfurt, Austria;Hungarian Academy of Sciences, Budapest, Hungary;Klagenfurt University, Klagenfurt, Austria;Hungarian Academy of Sciences, Budapest, Hungary;Klagenfurt University, Klagenfurt, Austria
Venue:
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Year:
2010

Citing 5
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
An overview of the OMNeT++ simulation environment

Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
LayerP2P: using layered video chunks in P2P live streaming

IEEE Transactions on Multimedia
An Architecture for Distributing Scalable Content over Peer-to-Peer Networks

MMEDIA '10 Proceedings of the 2010 Second International Conferences on Advances in Multimedia
Overview of the Scalable Video Coding Extension of the H.264/AVC Standard

IEEE Transactions on Circuits and Systems for Video Technology

NextSharePC: an open-source BitTorrent-based P2P client supporting SVC

Proceedings of the 3rd Multimedia Systems Conference
Collaborative caching for efficient dissemination of personalized video streams in resource constrained environments

Proceedings of the 3rd Multimedia Systems Conference
Piece selection algorithms for layered video streaming in P2P networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The distribution of layered content over peer-to-peer networks becomes more important today as the users are consuming the content on terminals with various display capabilities and different network connections. For single-layer content distribution, the piece-picking algorithm only needs to ensure that content pieces are downloaded in time for display. When layered content is distributed over a peer-to-peer network, the piece-picking algorithm needs to be modified to ensure that the best possible quality is displayed while all desired pieces still have to be received before their deadline expires. In this paper, the piece-picking problem for layered content is analyzed and a number of piece-picking algorithms for layered content based on the solutions for the knapsack problem are presented. Furthermore, an evaluation of these algorithms is performed and possible applications are discussed.