A scheduling method considering available bandwidth in selective contents broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., watching contents users selected themselves, have attracted great attention. For example, in a news program, after a user selects the desired content, he/she watches it. In selective contents broadcasting, since the server needs to deliver many contents, the necessary bandwidth for playing the data without interruptions increases. Although conventional methods reduce necessary bandwidth, they do not consider the upper limit in the bandwidth. When upper limit exists in the bandwidth, users have to wait to receive the data. In this paper, we propose a scheduling method to reduce waiting time by considering available bandwidth. In our proposed method, by acquiring the bandwidth that is the same as the data consumption rate, waiting time is effectively reduced.