By Topic

A contribution-aware multiple parent overlay network for P2P media streaming

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
$33 $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

3 Author(s)
Awiphan, S. ; Grad. Sch. of Fundamental Sci. & Eng., Waseda Univ., Tokyo, Japan ; Zhou Su ; Katto, J.

Service capacity and contribution of the peers have been proven to be the important factors for selecting a serving peer in the P2P overlay networks. In this paper, we study how to design a multi-parent overlay network in a contribution aware manner. Our idea is to utilize the outbound bandwidth of all overlay nodes efficiently. Different from other multi-source streaming approaches, we employ push-based data delivery in order to minimize the latency. The core of our overlay is conceived in a tree structure rooted at a source. The auxiliary connections with redundancy avoidance capability are proposed to increase the resilience of the tree. Furthermore, we introduce an overlay joining algorithm where the parent whose degrees are exhausted responses the new peer with a list of potential peers having residual degrees so that the new peer can join the overlay with minimal requests. Simulations through ns2 demonstrate the efficiency of our solution.

Published in:

Packet Video Workshop (PV), 2010 18th International

Date of Conference:

13-14 Dec. 2010