Generating asymptotically optimal broadcasting schedules to minimize average waiting time

DOI10.1016/J.DISC.2008.05.025MaRDI QIDQ1045062zbMATH OpenOpenAlexFDO

Authors Yi Sun, Fei Ma, Tsunehiko Kameda

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.05.025

zbMATH Keywords

schedulingvideo broadcastingvideo-on-demand

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Review text

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.

Recommendations

• Optimal dynamic video-on-demand using adaptive broadcasting
• scientific article; zbMATH DE number 2119694
• Windows Scheduling Problems for Broadcast Systems
• Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
• Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ

Cites work

• Harmonic broadcasting is bandwidth-optimal assuming constant bit rate
• scientific article; zbMATH DE number 2079413 (Why is no real title available?)
• scientific article; zbMATH DE number 2119694 (Why is no real title available?)
• Lower bounds on average-case delay for video-on-demand broadcast protocols
• Nearly optimal perfectly-periodic schedules
• Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ

Cited in

(6)

• Lower bounds on average-case delay for video-on-demand broadcast protocols
• Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
• scientific article; zbMATH DE number 2119693 (Why is no real title available?)
• Harmonic broadcasting is bandwidth-optimal assuming constant bit rate
• Optimal dynamic video-on-demand using adaptive broadcasting
• An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services

This page was built for publication: Generating asymptotically optimal broadcasting schedules to minimize average waiting time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045062)