A Scheduling Method to Reduce Waiting Time for Close-Range Broadcasting
Author(s) -
Yusuke Gotoh,
Tomoki Yoshihisa,
Hideo Taniguchi,
Masanori Kanazawa,
Wenny Rahayu,
YiPing Phoebe Chen
Publication year - 2012
Publication title -
mobile information systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.346
H-Index - 34
eISSN - 1875-905X
pISSN - 1574-017X
DOI - 10.1155/2012/768269
Subject(s) - computer science , broadcasting (networking) , scheduling (production processes) , schedule , bandwidth (computing) , real time computing , range (aeronautics) , drama , computer network , multimedia , operating system , art , operations management , materials science , literature , economics , composite material
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom