A scheduling method to reduce waiting time for close-range broadcasting

Article type: Research Article

Authors: Gotoh, Yusuke^; | Yoshihisa, Tomoki | Taniguchi, Hideo | Kanazawa, Masanori | Rahayu, Wenny | Chen, Yi-Ping Phoebe

Affiliations: Okayama University, Okayama, Japan | La Trobe University, Melbourne, VIC, Australia | Osaka University, Osaka, Japan | The Kyoto College of Graduate, Studies for Informatics, Kyoto, Japan

Note: [] Corresponding author: Yusuke Gotoh, Okayama University, Okayama, Japan. E-mail: gotoh@cs.okayama-u.ac.jp

Abstract: Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main program continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When the server schedules two types of continuous media data, waiting time that occurs from finishing the highlight scene to starting the main scene, may increase. In this paper, we propose a scheduling method to reduce the waiting time for close-range broadcasting. In our proposed method, by dividing two types of data and producing an effective broadcast schedule considering the available bandwidth, we can reduce the waiting time.

Keywords: Close-range broadcasting, scheduling, waiting time, continuous media data

DOI: 10.3233/MIS-2012-00150

Journal: Mobile Information Systems, vol. 8, no. 4, pp. 303-314, 2012