@Article{Szkaliczki2010,
author = {Szkaliczki, Tibor and Eberhard, Michael and Hellwagner, Hermann and Szobonya, László},
journal = {Electronic Notes in Discrete Mathematics},
title = {Piece Selection Algorithm for Layered Video Streaming in P2P Networks},
year = {2010},
issn = {1571-0653},
month = {aug},
note = {ISCO 2010 - International Symposium on Combinatorial Optimization},
pages = {1265-1272},
volume = {36},
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.},
address = {New York, USA},
doi = {10.1016/j.endm.2010.05.160},
keywords = {streaming, layered video, knapsack problem},
language = {EN},
pdf = {https://www.itec.aau.at/bib/files/ISCO'10_Eberhard.pdf},
publisher = {Elsevier Inc.},
url = {
http://www.sciencedirect.com/science/article/B75GV-50JJF7F-5P/2/7d978923400f50d4c42165003c64c351}
}