Eberhard, Michael and Szkaliczki, Tibor and Hellwagner, Hermann and Szobonya, László and Timmerer, Christian (2010) Knapsack problem-based piece-picking algorithms for layered content in peer-to-peer networks. In: AVSTP2P 2010. Proceedings of the 2010 ACM workshop on advanced video streaming techniques for peer-to-peer networks and social networking. Firenze, 2010..

Text citation.cfmid1877891andcollDLanddlGUIDEandCFID5825936andCFTOKEN70013777 - Published Version Restricted to Registered users only Download (43kB)

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.

Item Type:	Conference or Workshop Item (Paper)
Uncontrolled Keywords:	Knapsack Problem, Layered/Scalable Content, Piece-Picking, Piece Utility Calculation
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:38
Last Modified:	12 Dec 2012 08:38
URI:	https://eprints.sztaki.hu/id/eprint/6433

Update Item