In broadcast scheduling multiple users requesting the same information can be satisfied with one single broadcast. In this paper we study preemptive on-demand broadcast scheduling with deadlines on a single broadcast channel. We will show that the upper bound results in traditional real-time scheduling does not hold under broadcast scheduling model. We present two easy to implement online algorithms BCast and its variant BCast2. Under the assumption the requests are approximately of equal length (say k), we show that BCast is O(k) competitive. We establish that this bound is tight by showing that every online algorithm is Ω(k) competitive even if all requests are of same length k. We then consider the case where the laxity of each request is proportional to its length. We show that BCast is constant competitive if all requests are approximately of equal length. We then establish that BCast2 is constant competitive for requests with arbitrary length. We also believe that a combinatorial lemma that we use to derive the bounds can be useful in other scheduling system where the deadlines are often changing (or advanced). © Springer-Verlag 2003.
CITATION STYLE
Kalyanasundaram, B., & Velauthapillai, M. (2003). On-demand broadcasting under deadline. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 313–324. https://doi.org/10.1007/978-3-540-39658-1_30
Mendeley helps you to discover research relevant for your work.