Piece selection algorithms for layered video streaming in P2P networks

Discrete Applied Mathematics

Volumn 167, Issue , 2014, Pages 269-279

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

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Knapsack problem; Layered scalable content; Multimedia; Peer to peer network; Piece selection; Streaming

Indexed keywords

EID: 84894501613     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2013.11.007     Document Type: Article

References (17)

1. S. Albers Competitive online algorithms BRICS Lecture Series LS-96-2 1996 1 33
2. R. Andonov, V. Poirriez, and S. Rajopadhye Unbounded knapsack problem: dynamic programming revisited European J. Oper. Res. 123 2 2000 394 407
3. I. Baumgart, B. Heep, S. Krause, Oversim: a flexible overlay network simulation framework, in: IEEE Global Internet Symposium, 2007, pp. 79-84.
4. A. Borodin, and R. El-Yaniv Online Computation and Competitive Analysis 1998 Cambridge University Press 0-521-56392-5
5. L-T. Cheok, A. Eleftheriadis, Operations research approach towards layered multi-source video delivery, in: Picture Coding Symposium, PCS, San Francisco, CA, USA, 2004.
6. G.B. Dantzig Discrete-variable extremum problems Oper. Res. 5 1957 266 277
7. M. Eberhard, T. Szkaliczki, H. Hellwagner, L. Szobonya, C. Timmerer, Knapsack problem-based piece-picking algorithms for layered content in peer-to-peer networks, in: Workshop on Advanced Video Streaming Techniques for Peer-to-Peer Networks and Social Networking, ACM Multimedia, 25-29 October, Firenze, Italy, 2010.
8. http://eprints.sztaki.hu/7167/
9. B. Han, J. Leblet, and G. Simon Hard multidimensional multiple choice knapsack problems, an empirical study Comput. Oper. Res. 37 1 2010 172 181
10. S. Khan, K.F. Li, E.G. Manning, and M. Akbar Solving the knapsack problem for adaptive multimedia Stud. Inform. 2 1 2003 157 178 Special issue on cutting, packing and knapsacking problems
11. Z. Qu, L. Li, and J. Li Design and implementation on the P2P VOD system based on the RF-IPS algorithm Int. J. Commun., Netw. Syst. Sci. 3 2010 745 749
12. N. Samphaiboon, and T. Yamada Heuristic and exact algorithms for the precedence-constrained knapsack problem J. Optim. Theory Appl. 105 2002 659 676
13. H. Schwarz, D. Marpe, and T. Wiegand Overview of the scalable video coding extension of the H.264/AVC standard IEEE Trans. on CSVT 17 9 2007 1103 1120
14. D.D. Sleator, and R.E. Tarjan Amortized efficiency of list update and paging rules Commun. ACM 28 2 1985 202 208
15. T. Szkaliczki, M. Eberhard, H. Hellwagner, and L. Szobonya Piece selection algorithm for layered video streaming in P2P networks International Symposium on Combinatorial Optimization, ISCO, March 24-26, 2010, Hammamet, Tunisia Electronic Notes in Discrete Mathematics vol. 36 2010 Elsevier 1265 1272
16. J. Zhang, L. Cheng, X. Zhu, An improved strategy of piece selection in P2P, in: 21st Annual International Conference on Chinese Control and Decision Conference, CCDC, Guilin, China, 2009, pp. 4493-4496.
17. M. Zink, O. Kuenzel, J. Schmitt, R. Steinmetz, Subjective impression of variations in layer encoded videos, in: ACM/IEEE International Symposium on Quality of Service, IWQoS, 2003, pp. 137-154.