Modeling and performance analysis of pull-based live streaming schemes in Peer-to-Peer network

Abstract

Recent years mesh-based Peer-to-Peer live streaming has become a promising way for service providers to offer high-quality live video streaming service to Internet users. In this paper, we make a detailed study on modeling and performance analysis of the pull-based P2P streaming systems. We establish the analytical framework for the pull-based streaming schemes in P2P network, give accurate models of the chunk selection and peer selection strategies, and organize them into three categories, i.e., the chunk first scheme, the peer first scheme and the epidemic scheme. Through numerical performance evaluation, the impacts of some important parameters, such as size of neighbor set, reply number, buffer size and so on are investigated. For the peer first and chunk first scheme, we show that the pull-based schemes do not perform as well as the push-based schemes when peers are limited to reply only one request in each time slot. When the reply number increases, the pull-based streaming schemes will reach close to optimal playout probability. As to the pull-based epidemic scheme, we find it has unexpected poor performance, which is significantly different from the push-based epidemic scheme. Therefore we propose a simple, efficient and easily deployed push-pull scheme which can significantly improve the playout probability.

Slack time–based scheduling scheme for live video streaming in P2P network

“…Some of the applications that uses the pull‐based scheduling method are PPstream and PPLive. A detailed analysis and measurement study of pull‐based approach is given in previous studies …”

“…A detailed analysis and measurement study of pull-based approach is given in previous studies. 41,42 Figure 1 shows the classification of pull-based scheduling scheme according to peer and chunk selection mechanism. After receiving the buffer map from its neighbor, the peer chooses a chunk that is not available in its buffer and searches for a parent peer that can provide the chunk.…”

LR2: Improving Push-Based Live Streaming and File Sharing in Peer-to-Peer Network

“…Through a similar but simplified method, Zhou et al [19] study the rarest first and the greedy strategies in pull-based mode, and propose a mixed strategy that can exploit the advantages of both the two strategies. As further studies, in our recent work [20] we established an analytical framework for pull-based P2P live streaming schemes, where all streaming schemes are divided into three categories, the chunk first scheme, the peer first scheme and the epidemic scheme. Liang et al [21] make a comparison study on the random pull scheduling, adaptive Queue-based Chunk Scheduling and Random Useful Packet Forwarding on the PlanetLab.…”

“…In this paper, we will focus on two categories of schemes, i.e., the chunk first (CF) scheme and the peer first (PF) scheme [20]. In the CF scheme, the decision which chunk is chosen is made only based on the local peer's buffer, irrespective of its neighboring peers' buffer maps, and this is very different from the definition of CF scheme in [20]. In the PF scheme, the decision which chunk is chosen is made based on the chosen neighbor's buffer map.…”

Optimized cooperative streaming in wireless mesh networks

“…This problem has been extensively studied [24], [25], [26], and in some specific contexts with restrictive assumptions, the existence of an optimal scheduling strategy has been proven [27].…”