Scalable Live Streaming Service Based on Interoverlay Optimization

Abstract

Abstract-In order to provide scalable live streaming services, we propose an Interoverlay Optimization scheme, IOO. Instead of selecting better paths in the same overlay, IOO constructs efficient paths using peers in different overlays so as to 1) improve global resource utilization of peer-to-peer (P2P) streaming networks, 2) assign resources based on their locality and delay, 3) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays, and 4) balance the load among the group (streaming overlay) members. We compare the performance of IOO with existing approaches through trace-driven simulations. Results show that IOO outperforms previous schemes in terms of resource utilization and the quality of service (QoS) of streaming services. The IOO scheme has been implemented in an Internet-based live streaming system, called AnySee. AnySee was successfully released in the summer of 2004 in the China Educational Research Network (CERNET). More than 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences videos.

Streaming Performance in Multiple-Tree-Based Overlays

“…For every (n, k) there is a loss probability p max below which the packet possession probability π f (∞) > 0 and above which π f (∞) = 0. Furthermore, for any 0 < δ < 1 there is (n, k) such that π f (∞) ≥ δ. Consequently, in the considered overlay if p > p max , then lim N→∞ π = 0, because (1) , and lim N→∞ π f (L − 1) = 0. For p < p max stability depends on the number of layers in the overlay and the FEC block length due to the initial condition π f (L−1) (0) = (1− p) L−1 , but not directly on the number of nodes.…”

“…The π(i) (z) can then be calculated using (3). The calculation of π and σ are straightforward, since π = π (1) , and σ 2 = π (2) − π 2…”

“…Several works deal with the management of the overlay, with giving incentives for collaboration, with peer selection and tree reconstruction considering peer heterogeneity and the underlying network topology ( [1][2][3][4][5][6] and references therein).…”

An Adaptive Buffering Scheme for P2P Live and Time-Shifted Streaming

“…To address this problem, many mesh structures have been proposed [4][5][6][7][8]. In the mesh structures, even though a peer's neighbor leaves the network, it can still receive data from its remaining neighbors, since it receives data from several neighbor peers simultaneously.…”

“…Therefore, highly scalable peer-to-peer (P2P)-based IPTV systems that can be implemented at low installation cost have emerged as an alternative to conventional systems [1,2]. In mesh-based structures that have been employed by most commercial P2P streaming systems, peers share data required for video playback [3][4][5][6][7][8]. To do so, they exchange buffermaps with their neighbor peers to find which peers have the necessary chunks.…”