Generating asymptotically optimal broadcasting schedules to minimize average waiting time (Q1045062)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generating asymptotically optimal broadcasting schedules to minimize average waiting time
scientific article

    Statements

    Generating asymptotically optimal broadcasting schedules to minimize average waiting time (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    In the paper under review, video-on-demand broadcasting systems are studied with the objective to minimize the average waiting time for the customers before they can start viewing. It is assumed that a fixed start points (FSP) scheme is used which means that the customers can start downloading at prespecified time points. A heuristic algorithm is presented which generates so-called harmonic block windows schedules. In simulation experiments it is shown that the average waiting time of the generated schedules asymptotically approaches a lower bound among all FSP schedules.
    0 references
    0 references
    0 references
    scheduling
    0 references
    video-on-demand
    0 references
    video broadcasting
    0 references
    0 references