A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.