By Topic

Optimal Overlay Construction on Heterogeneous Live Peer-to-Peer Streaming Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Min Yang ; Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY, USA ; Yuanyuan Yang

Media streaming is an important Internet application and has received more and more attention in recent years. Traditional media streaming systems are deployed in a server-client mode which scales poorly with the increasing population of the clients. Peer-to-peer media streaming can greatly enhance the scalability of the system by employing the clients to help forward the media content. In this paper, we consider optimizing the overlay construction for peer-to-peer streaming systems with heterogeneous access link bandwidths. Our goal is to maximize the total downloading rate and satisfy the heterogeneous downloading requirements when the uplink bandwidth is limited. We first formalize it into a problem of finding maximum number of edge disjoint trees in a graph which models the peers and their access link bandwidths. Then we give a centralized heuristic algorithm to solve the problem. Based on the centralized algorithm, we further propose a distributed algorithm which constructs an adaptive overlay topology that can adapt itself to the changing peers such that the end-to-end delay and link stress are minimized. We compare our scheme with another recently proposed scheme called MDM through simulations. Our simulation results show that the proposed scheme outperforms MDM by about 30% with respect to the average peer satisfaction. In addition, the proposed scheme achieves less link stress than MDM.

Published in:

Parallel Processing (ICPP), 2010 39th International Conference on

Date of Conference:

13-16 Sept. 2010