A method to reduce waiting time for close-range broadcasting

  • Authors:

  • Yusuke Gotoh;Tomoki Yoshihisa;Hideo Taniguchi;Masanori Kanazawa;Wenny Rahayu;Yi-Ping Phoebe Chen

  • Affiliations:

  • Okayama University, Okayama, Japan;Osaka University, Osaka, Japan;Okayama University, Okayama, Japan;The Kyoto College of Graduate Studies for Informatics, Kyoto, Japan;La Trobe University, Melbourne, Australia;La Trobe University, Melbourne, Australia

  • Venue:
  • Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to the recent popularization of digital webcast systems. close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a movie program, 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 two types of continuous media data are scheduled, 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 effectively reduce the waiting time.