By Topic

A novel time-aware block scheduling model for media streaming in peer-to-peer overlay networks

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

3 Author(s)
Jingxing Liao ; Coll. of Math. Sci., Grad. Univ. of the Chinese Acad. of Sci., Beijing, China ; Wenguo Yang ; Tie Liu

Recently, media streaming applications called as data-driven approaches have attracted a lot of attention. In these applications, node independently selects its neighbors and obtains desirable blocks from neighbors. There are two steps in the applications. One is overlay construction, another is block scheduling. However, most of the related research works focused on the former issue, few concentrated on optimizing the block scheduling to improve the system performance, especially in peer-to-peer overlay network. In this paper, we propose a novel time-aware block scheduling model considering bandwidth and block deadline constraints to solve the problem. We then propose an algorithm to minimize the total time of block scheduling and take an example to explain the algorithm. Simulation results indicate that our proposed algorithm performs better with high average delivery ratio.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010