Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.endm.2010.05.160 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
streaming,knapsack problem,layered video | Computer science,Video streaming,Selection algorithm,Node (networking),Download,Computer network,Bandwidth (signal processing),Knapsack problem | Journal |
Volume | ISSN | Citations |
36 | Electronic Notes in Discrete Mathematics | 4 |
PageRank | References | Authors |
0.54 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tibor Szkaliczki | 1 | 60 | 7.57 |
| Michael Eberhard | 2 | 32 | 4.52 |
| Hermann Hellwagner | 3 | 1114 | 134.97 |
| Laszlo Szobonya | 4 | 18 | 2.04 |