Piece selection algorithms for layered video streaming in P2P networks

摘要

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.