Piece selection algorithm for layered video streaming in P2P networks

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 1265-1272

  Szkaliczki, Tibor ^a   Eberhard, Michael ^b   Hellwagner, Hermann ^b   Szobonya, László ^a  

^a INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Knapsack problem; Layered video; Streaming

Indexed keywords

EID: 77954926627     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.160     Document Type: Article

References (7)

1. Andonov R., Poirriez V., Rajopadhye S. Unbounded knapsack problem: Dynamic programming revisited. European Journal of Operational Research 2000, 123(2):394-407.
2. Cheok, L-T. and Eleftheriadis, A. Operations Research Approach Towards Layered Multi-Source Video Delivery, in Picture Coding Symposium 2004, (San Francisco, CA, USA), Dec. 2004.
3. Dantzig G.B. DiscreteVariable Extremum Problems. Operations Research 1957, 5:266277.
4. Han B., Leblet J., Simon G. Hard multidimensional multiple choice knapsack problems, an empirical study. Computers and Operations Research January 2010, 37(1):172-181.
5. Khan S., Li K.F., Manning E.G., Akbar M. Solving the knapsack problem for adaptive multimedia. Studia Informatica 2003, 2(1):157-178.
6. Schwarz H., Marpe D., Wiegand T. Overview of the Scalable Video Coding Extension of the H.264/AVC Standard. IEEE Trans. on CSVT 2007, 17(9):1103-1120.
7. Zink, M., Kuenzel, O., Schmitt, J., Steinmetz, R., Subjective Impression of Variations in Layer Encoded Videos, IWQoS 2003: 137-154.