Szkaliczki, Tibor and Eberhard, Michael and Hellwagner, Hermann and Szobonya, László (2010) Piece selection algorithm for layered video streaming in P2P networks. Electronic Notes in Discrete Mathematics, 36. pp. 1265-1272.

Text S1571065310001617.pdf - Published Version Restricted to Registered users only Download (213kB)

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 typical problems and solutions in the knapsack problem.

Item Type:	Article
Uncontrolled Keywords:	Knapsack problem; Layered video; Streaming
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	ELearning Department
Depositing User:	Eszter Nagy
Date Deposited:	12 Dec 2012 08:39
Last Modified:	12 Dec 2012 08:39
URI:	https://eprints.sztaki.hu/id/eprint/6443

Update Item