Generating asymptotically optimal broadcasting schedules to minimize average waiting time

The performance of a Video-on-Demand broadcasting scheme is commonly evaluated by the maximum waiting time encountered by the customer before viewing can start. This paper addresses the issue of minimizing the average waiting time. Recently, we proposed Harmonic Block Windows scheduling to specifically minimize the average waiting time for given bandwidth. Here, we present an efficient heuristic algorithm that generates asymptotically optimal Harmonic Block Windows schedules. Using simulation, we demonstrate that, as we increase the ''block size'', the normalized average waiting time of these schedules approaches the theoretical minimum achievable by any ''fixed start points'' schedule.