Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aacharya, A., Muthukrishnan, S.: Scheduling On-demand Broadcasts: New Metrics and Algorithms. In: MobiCom (1998)
Bar-Noy, A., Guha, S., Katz, Y., Naor, J.: Throughput maximization of real-time scheduling with batching. In: Proceedings of ACM/SIAM Symposium on Discrete Algorithms (January 2002)
Bartal, Y., Muthukrishnan, S.: Minimizing Maximum Response Time in Scheduling Broadcasts. In: SODA, pp. 558–559 (2000)
Edmonds, J., Pruhs, K.: Multicast pull scheduling: When fairness is fine. In: Proceedings of ACM/SIAM Symposium on Discrete Algorithms (January 2002)
Erlebach, T., Hall, A.: Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In: Proceedings of ACM/SIAM Symposium on Discrete Algorithms (January 2002)
Gandhi, R., Khuller, S., Kim, Y., Wan, Y.-C.: Approximation algorithms for broadcast scheduling. In: Proceedings of Conference on Integer Programming and Combinatorial Optimization (2002)
Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, S.: Dependent rounding in bipartite graphs. In: IEEE Symposium on Foundations of Computer Science (2002)
Kalyanasundaram, B., Pruhs, K.R.: Speed is as Powerful as Clairvoyance. In: IEEE Symposium on Foundation of Computation, pp. 214–221 (1995)
Kalyanasundaram, B., Pruhs, K.R., Velauthapillai, M.: Scheduling Broadcasts in Wireless Networks. Journal of Scheduling 4, 339–354 (2001)
Kenyon, C., Schabanel, N., Young, N.: Polynomial-time approximation schemes for data broadcasts. In: Proceedings of Symposium on Theory of Computing, pp. 659–666 (2000)
Kim, J.H., Chowa, K.Y.: Scheduling broadcasts with deadlines. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, Springer, Heidelberg (2003)
Phillips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: ACM Symposium on Theory of Computing, pp. 140–149 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalyanasundaram, B., Velauthapillai, M. (2003). On-Demand Broadcasting Under Deadline. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive