A Broadcasting Scheme for Selective Contents Considering Available Bandwidth

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., watching contents selected by users themselves, have attracted great attention. For example, in a news program, after a user selects an interesting content, he/she watches it. In selective contents broadcasting, since the server needs to deliver many contents, the necessary bandwidth for continuously playing the data increases. Conventional schemes reduce the necessary bandwidth by producing an effective broadcast schedule. However, they do not consider the upper limit in the bandwidth. When an upper limit exists in the bandwidth, users may wait to play the data. In this paper, we propose a broadcasting scheme that reduces waiting time by considering available bandwidth. In our proposed scheme, by acquiring the channel bandwidth that is the same as the data consumption rate, we effectively reduce the waiting time.