Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You and Your Team.

Learn More →

A method to reduce waiting time on node relay‐based webcast for selective contents

A method to reduce waiting time on node relay‐based webcast for selective contents Purpose – The purpose of this paper is to reduce the waiting time on webcast for selective contents, by proposing a scheduling method called the “contents prefetched broadcasting considering user participation” (CPB‐CP) method. Design/methodology/approach – The authors analyze and evaluate the performance of the proposed CPB‐CP method. Findings – It is confirmed that the proposed method gives shorter average waiting time than the conventional methods. Research limitations/implications – A future direction of this study will involve making a scheduling method in the case where the playing time of each content item is different. Practical implications – In selective contents delivery, users may wait for the next bit of content to start playing after watching the previous one. In quiz programs, users may wait to receive the content data for their selected answer after they select their answer. Originality/value – In the CPB‐CP method, when a provider node pulls out of the network while delivering contents, waiting time is reduced effectively by reconstructing a delivery schedule that considers the available bandwidth of each provider node. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Information Systems Emerald Publishing

A method to reduce waiting time on node relay‐based webcast for selective contents

Loading next page...
 
/lp/emerald-publishing/a-method-to-reduce-waiting-time-on-node-relay-based-webcast-for-B2cptTRRAw
Publisher
Emerald Publishing
Copyright
Copyright © 2011 Emerald Group Publishing Limited. All rights reserved.
ISSN
1744-0084
DOI
10.1108/17440081111165875
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to reduce the waiting time on webcast for selective contents, by proposing a scheduling method called the “contents prefetched broadcasting considering user participation” (CPB‐CP) method. Design/methodology/approach – The authors analyze and evaluate the performance of the proposed CPB‐CP method. Findings – It is confirmed that the proposed method gives shorter average waiting time than the conventional methods. Research limitations/implications – A future direction of this study will involve making a scheduling method in the case where the playing time of each content item is different. Practical implications – In selective contents delivery, users may wait for the next bit of content to start playing after watching the previous one. In quiz programs, users may wait to receive the content data for their selected answer after they select their answer. Originality/value – In the CPB‐CP method, when a provider node pulls out of the network while delivering contents, waiting time is reduced effectively by reconstructing a delivery schedule that considers the available bandwidth of each provider node.

Journal

International Journal of Web Information SystemsEmerald Publishing

Published: Aug 30, 2011

Keywords: Scheduling; Waiting time; Selective contents; Node relays; Webcast; Playsequence graph; Available bandwidth; Data streaming; Internet; Web sites

References