A study on broadcasting methods in BroGrid environments

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watch their selected contents, have attracted attention. 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 do not consider the possibilities that a content is selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. We have proposed a broadcasting system in grid environments, called BroGrid. In this paper, we propose a scheduling method on selective contents broadcasting considering transition probability in BroGrid environments. Our proposed method reduces the waiting time by allocating broadcast channels that have same bandwidth as the contents consumption rate and scheduling contents considering transition probability.