Title: A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth

Authors: Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi, Masanori Kanazawa

Addresses: Graduate School of Natural Science and Technology, Okayama University, Okayama 7008530, Japan. ' Cybermedia Center, Osaka University, Osaka 5650871, Japan. ' Graduate School of Natural Science and Technology, Okayama University, Okayama 7008530, Japan. ' The Kyoto College of Graduate Studies for Informatics, 7 Monzen-cho Tanaka Sakyo-ku, Kyoto 6068225, Japan

Abstract: Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.

Keywords: continuous media data; node relay-based webcast; scheduling; waiting time; available bandwidth.

DOI: 10.1504/IJGUC.2011.042945

International Journal of Grid and Utility Computing, 2011 Vol.2 No.4, pp.295 - 302

Received: 03 Jan 2011
Accepted: 19 Apr 2011
Published online: 28 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article