A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth Online publication date: Sat, 28-Mar-2015
by Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi, Masanori Kanazawa
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 4, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com