An efficient playout smoothing mechanism for layered streaming in P2P networks (original) (raw)
A simple model for chunk-scheduling strategies in P2P streaming
2011
Abstract Peer-to-peer (P2P) streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well understood. In this paper, we describe a simple stochastic model that can be used to compare different downloading strategies to random peer selection. Based on this model, we study the tradeoffs between supported peer population, buffer size, and playback continuity. We first study two simple strategies: Rarest First (RF) and Greedy.
On the impact of playout scheduling on the performance of peer-to-peer live streaming
Computer Networks, 2009
In this paper we examine the impact of the adopted playout policy on the performance of P2P live streaming systems. We argue and demonstrate experimentally that (popular) playout policies which permit the divergence of the playout points of different nodes can deteriorate drastically the performance of P2P live streaming. Consequently, we argue in favor of keeping different playout points "near-in-time", even if this requires sacrificing (dropping) some late frames that could otherwise be rendered (assuming no strict bidirectional interactivity requirements are in place). Such nearly synchronized playout policies create "positive correlation" with respect to the available frames at different playout buffers. Therefore, they increase the number of upstream relay nodes from which a node can pull frames and thus boost the playout quality of both single-parent (tree) and multiple-parent (mesh) systems. On the contrary, diverging playout points reduce the number of upstream parents that can offer a gapless relay of the stream. This is clearly undesirable and should be avoided as it contradicts the fundamental philosophy of P2P systems which is to supplement an original service point with as many additional ones presented by the very own users of the service. * A layered coding scheme in which each layer/description/substream is independently decodable and full stream quality amounts to obtaining all the layers. 4
IET Commun., 2020
In recent years, peer-to-peer (P2P) live streaming is popularised by the scalability and cost-effectiveness of P2P networks. User satisfaction in P2P live streaming systems depends on several factors, including chunk scheduling techniques and overlay construction mechanisms in these systems. P2P live streaming systems are involved with the peer and chunk selection problems to improve quality parameters of streaming, such as playback continuity, startup delay, and playback latency. In this study, WidePLive as a P2P live video streaming system is proposed. In WidePLive, the authors proposed a low-delay overlay construction mechanism and a mixed strategy based chunk scheduling scheme which are coupled together by a contribution-aware peer selection strategy as a coupling feature to improve the quality parameter. The proposed overlay construction mechanism allows new peers to have the opportunity to connect with previous peers near the server and forms a low-depth and low-delay overlay....
Scheduling P2P multimedia streams: Can we achieve performance and robustness?
2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications, IMSAA 2009, 2009
Scheduling the transmission of information in P2P applications is one of the main challenges, and one of the keys to success, for these applications. We concentrate on lowlatency streaming applications (e.g. TV) and explore different combinations of chunk and peer scheduling strategies, finding that the majority of the proposals found in the literature are not robust to changing conditions. We then propose a new scheduling combination that aims at robustness in face of heterogeneous distribution of peers' available bandwidth and we show, through a comprehensive set of simulated realistic scenarios, that this scheduler outperforms all other combinations in any scenario experimented.
Proceedings of Spie the International Society For Optical Engineering, 2008
In this paper we examine the impact of the adopted playout policy on the performance of P2P live streaming systems. We argue and demonstrate experimentally that (popular) playout policies which permit the divergence of the playout points of different nodes can deteriorate drastically the performance of P2P live streaming. Consequently, we argue in favor of keeping different playout points "near-in-time", even if this requires sacrificing (dropping) some late frames that could otherwise be rendered (assuming no strict bidirectional interactivity requirements are in place). Such nearly synchronized playout policies create "positive correlation" with respect to the available frames at different playout buffers. Therefore, they increase the number of upstream relay nodes from which a node can pull frames and thus boost the playout quality of both single-parent (tree) and multiple-parent (mesh) systems. On the contrary, diverging playout points reduce the number of upstream parents that can offer a gapless relay of the stream. This is clearly undesirable and should be avoided as it contradicts the fundamental philosophy of P2P systems which is to supplement an original service point with as many additional ones presented by the very own users of the service. * A layered coding scheme in which each layer/description/substream is independently decodable and full stream quality amounts to obtaining all the layers.
LayerP2P: Using Layered Video Chunks in P2P Live Streaming
IEEE Transactions on Multimedia, 2000
Abstract Although there are several successful commercial deployments of live P2P streaming systems, the current designs; lack incentives for users to contribute bandwidth resources; lack adaptation to aggregate bandwidth availability; and exhibit poor video quality when bandwidth availability falls below bandwidth supply. In this paper, we propose, prototype, deploy, and validate LayerP2P, a P2P live streaming system that addresses all three of these problems. LayerP2P combines layered video, mesh P2P distribution, and a ...
Deadline-based differentiation in P2P streaming
GLOBECOM - IEEE Global Telecommunications Conference, 2010
Splitting a P2P video distribution in multiple media flows with different priorities is an interesting approach for developing flexible and adaptive streaming systems, ranging from VoD to TV. Such an approach can both yield satisfactory quality to all end users and be light in network resources usage, because low-priority flows can be discarded a-priori when target peers do not have enough resources to receive them. This paper focuses on chunk-based video distribution in unstructured meshes, adopting a push strategy (the sender takes the scheduling decision) based on buffer map exchange to avoid sending duplicated chunks. A deadline-based scheduling algorithm is proposed, where different flows of chunks are prioritized using different deadline postponing parameters for each flow. Some experimental results show good differentiation properties and streaming performance much better than with strict priority enforcement. Also, PSNR measures on real video streams show improvements compared to both strict priority and single stream distribution.
Multimedia Computing and Networking 2008, 2008
In this paper we examine the impact of the adopted playout policy on the performance of P2P live streaming systems. We argue and demonstrate experimentally that (popular) playout policies which permit the divergence of the playout points of different nodes can deteriorate drastically the performance of P2P live streaming. Consequently, we argue in favor of keeping different playout points "near-in-time", even if this requires sacrificing (dropping) some late frames that could otherwise be rendered (assuming no strict bidirectional interactivity requirements are in place). Such nearly synchronized playout policies create "positive correlation" with respect to the available frames at different playout buffers. Therefore, they increase the number of upstream relay nodes from which a node can pull frames and thus boost the playout quality of both single-parent (tree) and multiple-parent (mesh) systems. On the contrary, diverging playout points reduce the number of upstream parents that can offer a gapless relay of the stream. This is clearly undesirable and should be avoided as it contradicts the fundamental philosophy of P2P systems which is to supplement an original service point with as many additional ones presented by the very own users of the service. * A layered coding scheme in which each layer/description/substream is independently decodable and full stream quality amounts to obtaining all the layers.
Robust scheduling of video streams in network-aware P2P applications
IEEE International Conference on Communications, 2010
P2P TV and video streaming are among the most bandwidth-hungry applications running over the Internet. One of the main reasons is that the scheduling of information transfer between peers is extremely aggressive and does not take network characteristics into account. Moreover, schedulers are not designed to be robust and configurable, so that their performance is greatly affected by networking conditions. This work first analyzes the impact of network heterogeneity on the streaming performance and then proposes a novel, robust, configurable, network-aware scheduler that outperforms the other schedulers in all networking scenarios.
Playback Policies for Live and On-Demand P2P Video Streaming
Lecture Notes in Computer Science, 2012
Peer-to-peer (P2P) has become a popular mechanism for video distribution over the Internet, by allowing users to collaborate on locating and exchanging video blocks. The approach LiveShift supports further collaboration by enabling storage and a later redistribution of received blocks, thus, enabling time shifting and video-on-demand in an integrated manner. Video blocks, however, are not always downloaded quickly enough to be played back without interruptions. In such situations, the playback policy defines whether peers (a) stall the playback, waiting for blocks to be found and downloaded, or (b) skip them, losing information. Thus, for the fist time this paper investigates in a reproducible manner playback policies for P2P video streaming systems. A survey on currently-used playback policies shows that existing playback policies, required by any streaming system, have been defined almost arbitrarily, with a minimal scientific methodology applied. Based on this survey and on major characteristics of video streaming, a set of five distinct playback policies is formalized and implemented in LiveShift. Comparative evaluations outline the behavior of those policies under both under-and over-provisioned networks with respect to the playback lag experienced by users, the share of skipped blocks, and the share of sessions that fail. Finally, playback policies with most suitable characteristics for either live or on-demand scenarios are derived.
A comprehensive study of delivery strategies with chunk scheduling for mesh P2P live streaming
Proceedings of the 5th International Confernece on Ubiquitous Information Management and Communication - ICUIMC '11, 2011
The Internet video distribution becomes popular in recent years. Peer-to-peer (P2P) live streaming based on mesh structures exploits successfully peers' bandwidth to deliver video content. Due to three characteristics: time sensitive data, small and timeshifted buffer, and long last streaming traffic for P2P live streaming, we believe that the appropriate delivery strategies and chunk scheduling can improve the QoE (quality of experience). In this work, we perform a comprehensive study for various delivery strategies and make a simulated comparison. In addition, we also propose a novel delivery strategy that can be incorporated into the existing P2P streaming systems for enhancing their QoS (quality of service).
Scalable video streaming over P2P networks: A matter of harmony
2011
In this paper we address the problem of efficient layered video streaming over peer-to-peer networks and we propose a new receiver-driven streaming mechanism. The main design goal of our new layered video requesting policy is to optimize the overall distribution of video streams in terms of reliability and overhead. Since the layered peer-to-peer streaming problem is NP-Hard, we show that the classic approaches widely used in layered P2P streaming systems have some limitations and we propose an optimization technique based on harmony search which aims at increasing the rate of successful data transmissions for the most important video layers, while reducing the protocol overhead and ensuring load balancing among the participating peers. Analytical results have demonstrated that our new requesting policy enhances the streaming of layered video over mesh-based peer-to-peer networks and outperforms classic approaches.
Investigating the Scheduling Sensitivity of P2P Video Streaming: An Experimental Study
IEEE Transactions on Multimedia, 2000
Peer-to-Peer (P2P) technology has recently been employed to deliver large scale video multicast services on the Internet. Considerable efforts have been made by both academia and industry on P2P streaming design. While academia mostly focus on exploring design space to approach the theoretical performance bounds, our recent measurement study on several commercial P2P streaming systems indicates that they are able to deliver good user Quality of Experience with seemingly simple designs. One intriguing question remains: how elaborate should a good P2P video streaming design be? Towards answering this question, we developed and implemented several representative P2P streaming designs, ranging from theoretically proved optimal designs to straightforward "naive" designs. Through an extensive comparison study on PlanetLab, we unveil several key factors contributing to the successes of simple P2P streaming designs, including system resource index, server capacity and chunk scheduling rule, peer download buffering and peering degree. We also identify regions where naive designs are inadequate and more elaborate designs can improve things considerably. Our study not only brings us better understandings and more insights into the operation of existing systems, it also sheds lights on the design of future systems that can achieve a good balance between the performance and the complexity. respectively. His general research interests lie in modeling, design and analysis of communication networks. His current research directions include robust network routing, Peerto-Peer IPTV systems, overlay networks and network measurement. He is a member of IEEE and ACM.
Adaptive Peer Caching for P2P Video-on-Demand Streaming
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010
In this paper, we propose a novel P2P VoD streaming system, named PECAN where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer.
A push-based scheduling algorithm for large scale P2P live streaming
2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks, 2008
In this paper, we present a chunk scheduling algorithm for a mesh-based peer-to-peer live streaming system and we evaluate it by simulations over large-scale networks. Literature papers typically design chunk scheduling algorithms by considering the chunk delivery ratio as performance metric. We propose a push-based algorithm, which not only tries to maximize the chunk delivery ratio but it also takes into account and tries to minimize the delivery delay of chunks at the peer nodes. This is an important requirement, when dealing with realtime multimedia flows. Another important contribution of this paper is the design and implementation of a simulator able to evaluate the performance of large scale P2P networks (tens of thousands peers). The importance of this contribution lies in the fact that existing simulators and performance studies handle at most hundreds or few thousands of peers, while real-life P2P streaming systems aim at distributing contents to several hundreds of thousands, if not millions, of users. The performance evaluation study aims at providing a comprehensive view of what performance can be expected for mesh-based peer-to-peer streaming systems, both in terms of chunk delivery ratio and delay, for a large range of the number of users. The individual effect of a variety of system parameters, and especially number of partner nodes in the mesh, constrained link bandwidth, node heterogeneity, and network size, has been analyzed. Our results show that performances of the proposed push-based solution are already quite effective even with severely bandwidth constrained large scale networks.
Delay-Aware Push/Pull Protocols for Live Video Streaming in P2P Systems
2010 IEEE International Conference on Communications, 2010
P2P video streaming is receiving enormous attention, and when video is involved, the efficient use of the network becomes a very important issue, specially if live applications are addressed. In this work we study properties of Push/Pull protocols for the exchange of video chunks in non-structured systems. Push/Pull protocols are a broad class of chunk exchange mechanisms where peers alternate phases where they actively send chunks to other peers, with phases where they seek for missing chunks from other peers. We focus on the properties of the protocol, trying to gain insight on the distributed exchange mechanism itself. Then, we explore how performances can be improved if peers, in selecting the peers to exchange information with, also consider network level parameters, namely the round trip delay.
Scalable video distribution in peer-to-peer architecture
Conferência sobre Redes de Computadores, Universidade do Minho, Braga, Portugal, 2010
Abstract—The combination of Scalable Video Coding and Peerto-Peer networks is a potential area of innovation in terms of video streaming on the Internet. Applications for sharing files, such as BitTorrent, have been broadly developed and nowadays they cater for the majority of the Internet traffic, adding the need for the exploration of real-time streaming services based on these networks. Several Peer-to-Peer streaming techniques have been deployed, but very few explore bandwidth adaptation, support of diverse terminal and ...