@inproceedings{cb776b12329647f99b2bb2228ca0566c,
title = "On-demand bounded broadcast scheduling with tight deadlines",
abstract = "We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients request-ing the same page can be satis-ed simultaneously by one broadcast. The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satis-ed requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modi-ed algorithm, VAR, which is optimal for this case.",
keywords = "Broadcast schedul-ing, Competitive analysis, Tight deadline",
author = "Poon, \{Chung Keung\} and Feifeng Zheng and Yinfeng Xu",
year = "2006",
language = "英语",
isbn = "1920682333",
series = "Conferences in Research and Practice in Information Technology Series",
booktitle = "Theory of Computing 2006 - Proceedings of the 12th Computing",
note = "Theory of Computing 2006 - 12th Computing: The Australasian Theory Symposium, CATS 2006 ; Conference date: 16-01-2006 Through 19-01-2006",
}