@inproceedings{76049c88a46e4250a919995cb4354047,
title = "Stretch-optimal scheduling for on-demand data broadcasts",
abstract = "In order to effectively utilize the broadcast bandwidth, it is necessary to have efficient on-line scheduling algorithms that can balance individual and overall performance and can scale in terms of database sizes and client populations. Moreover, the scheduling algorithm should be applicable to a heterogeneous environment where data items have different sizes. We address these issues in this paper. As stretch is widely adopted as a performance metric for variable-size data requests, we propose a broadcast scheduling algorithm to optimize the system performance in terms of stretch. We show by analysis that the proposed algorithm can indeed achieve the optimal performance in terms of stretch. Moreover, the proposed scheduling algorithm has very low decision overhead, which makes it a practical solution for on-demand broadcast scheduling. Simulation results demonstrate that our algorithm significantly outperforms existing scheduling algorithms under various scenarios.",
author = "Yiqiong Wu and Guohong Cao",
note = "Publisher Copyright: {\textcopyright} 2001 IEEE.; 10th International Conference on Computer Communications and Networks, ICCCN 2001 ; Conference date: 15-10-2001 Through 17-10-2001",
year = "2001",
doi = "10.1109/ICCCN.2001.956311",
language = "English (US)",
series = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "500--504",
editor = "Ronald Luijten and E.K. Park and Jenny Li",
booktitle = "Proceedings - 10th International Conference on Computer Communications and Networks, ICCCN 2001",
address = "United States",
}