2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) (2015)
Nov. 4, 2015 to Nov. 6, 2015
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 scene 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. In addition, we have proposed the scheduling method to reduce the waiting time for close-range broadcasting. In this method, by setting the loading time of main scene, we can reduce total waiting time. However, when the server schedules two types of continuous media data, the loading time of highlight scene may increase. In this paper, we propose a scheduling method for close-range broadcasting based on loading time. In our proposed method, by producing an effective broadcast schedule considering both loading time of highlight scene and main scene, we can reduce the waiting time.
Broadcasting, Processor scheduling, Silicon, Cloud computing, Media
Y. Gotoh and T. Yoshihisa, "A Scheduling Method to Reduce Waiting Time for Close-Range Delivery," 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), Krakow, Poland, 2015, pp. 730-735.