Abstract
In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit. Upon the arrival of an item with a window w, where w is a positive integer, the item has to be scheduled on a channel such that it will be broadcasted in the channel at least once every w time units until its departure. With the on-line input of these temporary items, the problem is to minimize the maximum number of channels used over all time. We give a 5-competitive on-line algorithm and show that there is a lower bound of 2–ε for any ε > 0 on the competitive ratio of any on-line algorithm.
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
Acharya, S., Franklin, M., Zdonik, S.: Dissemination-based data delivery using broadcast disks. IEEE Personal Communications 2(6), 50–60 (1995)
Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performance Evaluation 5(4), 235–242 (1985)
Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM Journal on Computing 32(4), 1091–1113 (2003); (A preliminary version appears in SODA 2002)
Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: Proceedings of Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 224–233 (2004)
Bar-Noy, A., Naor, J., Schieber, B.: Pushing dependent data in clients-providers-servers systems. Wireless Network 9(5), 421–430 (2003)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Chan, M.Y., Chin, F.Y.L.: General schedulers for the pinwheel problem based on double-integer reduction. IEEE Transactions on Computers 41(6), 755–768 (1992)
Chan, M.Y., Chin, F.Y.L.: Schedulers for larger classes of pinwheel instances. Algorithmica 9(5), 425–625 (1993)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Dynamic bin packing. SIAM Journal on Computing (1983)
Fishburn, P.C., Lagarias, J.C.: Pinwheel scheduling: Achievable densities. Algorithmica 34(1), 14–38 (2002)
Gondhalekar, V., Jain, R., Werth, J.: Scheduling on airdisks: Efficient access to personalized information services via periodic wireless data broadcast. Proceedings of IEEE International Conference on Communications 3, 1276–1280 (1997)
Hua, K.A., Sheu, S.: Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems. In: Proceedings of ACM SIGCOMM conference SIGCOMM on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 89–100 (1997)
Juhn, L.-S., Tseng, L.-M.: Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting 43(3), 268–271 (1997)
Viswanathan, S., Imielinski, T.: Pyramid broadcasting for video-on-demand service. In: Proceedings of Conference on Multimedia Computing and Networking, pp. 66–77 (1995)
Viswanathan, S., Imielinski, T.: Metropolitan area video-on-demand service using pyramid broadcasting. ACM Journal of Multimedia Systems 4(3), 197–208 (1996)
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., Wong, P.W.H. (2004). On-Line Windows Scheduling of Temporary Items. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)