Broadcast scheduling for time-constrained information delivery

In this report, the problem of broadcast scheduling in Push broadcast systems is studied. We introduce an optimization approach that leads to well justified policies for Push broadcast systems with time constraints. In particular, we apply our results to a Push broadcast system with different deadlines associated to the files while allowing the files to have arbitrary demand rates and lengths. We calculate the optimal average cost for our experimental settings and show, through extensive simulation studies, that the results obtained from our scheduling policy are very close to that optimal value for each experiment.