A peer-to-peer architecture for efficient live scalable media streaming on internet

Lan, Xuguang; Zheng, Nanning; Xue, Jianru; Wu, Xiaoguang; Gao, Bin

doi:10.1145/1291233.1291410

Cited by 13 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The allocation of seed server resources in P2P streaming systems with scalable videos has been also considered in [9]. Lan et al [8] proposed a scheduling algorithm for peers to request data from senders.…”

Section: Department Of Electronic and Electricalmentioning

confidence: 99%

“…This figure shows that in the p function, more importance is given to the layer priority than to the reliability of the peer. This is because the lower layers in a SVC stream are essential for its successful Layer [2] Layer [3] Layer [4] Layer [5] Layer [6] Layer [7] Layer [8] Layer [9] follows: In our architecture, we have defined a BitTorrent-like protocol for data exchange between the peers. Each data piece, when sent to a peer, introduces an overhead (piece index, bloc index, offset) while the overhead of a request is defined by the request index and the data size.…”

Section: B2 Solution Fitnessmentioning

confidence: 99%

See 1 more Smart Citation

Scalable video streaming over P2P networks: A matter of harmony?

Medjiah

Ahmed

Mykoniati

et al. 2011

2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

View full text Add to dashboard Cite

Abstract-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.

show abstract

Section: Department Of Electronic and Electricalmentioning

confidence: 99%

Section: B2 Solution Fitnessmentioning

confidence: 99%

Scalable video streaming over P2P networks: A matter of harmony?

Medjiah

Ahmed

Mykoniati

et al. 2011

2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

View full text Add to dashboard Cite

show abstract

“…To address these issues, number of works have proposed P2P streaming systems with scalable video streams, e.g. [6,12,17,24,30]. Cui and Nahrstedt [6] present an algorithm to decide for each peer how to request video layers from a given set of senders.…”

Section: Related Workmentioning

confidence: 99%

“…Rejaie and Ortega [30] present a framework for layered P2P streaming, where a receiver coordinates the transmission of video packets from multiple senders using a TCP-friendly congestion control mechanism. Lan et al [17] propose a scheduling algorithm for peers to request data from senders. The allocation of seed server re-sources in P2P streaming systems with scalable videos has also been considered in [24].…”

Section: Related Workmentioning

confidence: 99%

Live peer-to-peer streaming with scalable video coding and networking coding

Mirshokraie

Hefeeda

2010

Proceedings of the First Annual ACM SIGMM Conference on Multimedia Systems

View full text Add to dashboard Cite

We present the design of a peer-to-peer (P2P) live streaming system that uses scalable video coding as well as network coding. The proposed design enables flexible customization of video streams to support heterogeneous receivers, highly utilizes upload bandwidth of peers, and quickly adapts to network and peer dynamics. Our design is simple and modular. Therefore, other P2P streaming systems could also benefit from various components of our design to improve their performance. We conduct an extensive quantitative analysis to demonstrate the expected performance gain from the proposed design. Our analysis uses actual scalable video traces and realistic P2P streaming environments with high churn rates, heterogeneous peers, and flash crowd scenarios. Our results show that the proposed system can achieve: (i) significant improvement in the visual quality perceived by peers (several dBs are observed), (ii) smoother and more sustained streaming rates, (iii) higher streaming capacity by serving more requests from peers, and (iv) more robustness against high churn rates and flash crowd arrivals of peers. This paper shows that the integration of network coding and scalable video coding in P2P live streaming systems yields better performance than current systems that use singlelayer streams and proposed systems that use either network coding alone or scalable video coding alone.

show abstract

“…Lan et al [18] present a high level architecture for datadriven P2P streaming with scalable videos. The authors propose a scheduling algorithm for peers to request data from senders.…”

Section: Related Workmentioning

confidence: 99%

Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos

Mokhtarian

Hefeeda

2009

2009 17th International Workshop on Quality of Service

View full text Add to dashboard Cite

Abstract-We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity. We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.

show abstract

A peer-to-peer architecture for efficient live scalable media streaming on internet

Cited by 13 publications

References 8 publications

Scalable video streaming over P2P networks: A matter of harmony?

Scalable video streaming over P2P networks: A matter of harmony?

Live peer-to-peer streaming with scalable video coding and networking coding

Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos

Contact Info

Product

Resources

About