Abstract
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the competitive ratio of the problem. The novelty of our work is the introduction of a new job scheduling problem that allows cancellation. We prove that the broadcasting problem can be reduced to this scheduling problem. This reduction frees us from the complication of the broadcasting model and allows us to work on a conceptually simpler model for upper bound results.
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.
Similar content being viewed by others
References
Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: Proceedings of the Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 558–559 (2000)
Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4, 125–144 (1992)
Edmonds, J., Pruhs, K.: Multicast pull scheduling: when fairness is fine. Algorithmica 36, 315–330 (2003); A preliminary version appears in SODA 2002
Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms, pp. 811–820 (2004)
Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. Journal of Scheduling 4(6), 339–354 (2001); In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 339–354. Springer, Heidelberg (2001)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 214–221 (2000)
Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Proceedings of the 11th Annual Annual European Symposium on Algorithms, pp. 313–324 (2003)
Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. In: Proceedings of the 9th Annual International Conference on Computing and Combinatorics, pp. 415–424 (2003)
Koren, G., Shasha, D.: Dover: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing 24(2), 318–339 (1995)
Pruhs, K., Uthaisombut, P.: A comparison of multicast pull models. In: Proceedings of the 10th Annual European Symposium on Algorithms, pp. 808–819 (2002)
Muthukrishnan Swarup Acharya, S.: Scheduling on-demand broadcasts: New metrics and algorithms. In: The Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 43–54 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, WT., Lam, TW., Ting, HF., Wong, P.W.H. (2004). New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive