Title of article
Piece Selection Algorithm for Layered Video Streaming in P2P Networks
Author/Authors
Szkaliczki، نويسنده , , Tibor and Eberhard، نويسنده , , Michael and Hellwagner، نويسنده , , Hermann and Szobonya، نويسنده , , Lلszlَ، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
1265
To page
1272
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.
Keywords
Knapsack problem , Layered video , Streaming
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455613
Link To Document