Generating asymptotically optimal broadcasting schedules to minimize average waiting time (Q1045062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.05.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019462839 / rank | |||
Normal rank | |||
Revision as of 18:37, 19 March 2024
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
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
scheduling
0 references
video-on-demand
0 references
video broadcasting
0 references
