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 knapsack problem. In this paper, a number of layered piece picking algorithms are presented and they are compared to each other. In a competitive analysis, the presented online algorithms are compared to an optimal offline algorithm. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2013.11.007 | Discrete Applied Mathematics |
Keywords | Field | DocType |
main goal,online algorithm,knapsack problem,piece selection algorithm,layered video content,p2p network,layered piece,competitive analysis,piece selection problem,optimal offline algorithm,available bandwidth,multimedia | Online algorithm,Computer science,Selection algorithm,Video streaming,Node (networking),Algorithm,Bandwidth (signal processing),Knapsack problem,Competitive analysis | Journal |
Volume | ISSN | Citations |
167 | 0166-218X | 2 |
PageRank | References | Authors |
0.37 | 8 | 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 |