By Topic

Efficient search and scheduling in P2P-based media-on-demand streaming service

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

4 Author(s)
Huicheng Chi ; Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol. ; Qian Zhang ; Juncheng Jia ; Xuemin Shen

We are interested in providing a media-on-demand streaming service to a large population of clients using a peer-to-peer approach. Since the demands of different clients are asynchronous and the contents of clients' buffers are continuously changing, finding partners with expected data and collaborating with them for future content delivery are very important and challenging problems. In this paper, we propose a generic buffer-assisted search (BAS) scheme to improve partner search efficiency by reducing the size of index overlay. We have also developed a novel scheduling algorithm based on deadline-aware network coding (DNC) to fully exploit network resources by dynamically adjusting the coding window size. Extensive simulation results demonstrate that BAS can provide a faster response time with less control cost than the existing search methods, and DNC improves the network capacity utilization and provides high streaming quality under different network conditions.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:25 ,  Issue: 1 )