Abstract
This paper gives a complete and tight mathematical analysis on the performance of the Most-Requested-First algorithm for on-demand data broadcast. The algorithm is natural and simple, yet its performance is surprisingly good in practice. We derive tight upper and lower bounds on MRF’s competitiveness and thus reveal the exact competitive ratios of the algorithm under different system configurations. We prove that the competitive ratio of MRF is exactly \(3 - \frac{\ell}{d}\) when the start-up delay d is a multiple of the page length ℓ; otherwise the ratio is 3.
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
Aksoy, D., Franklin, M.: Scheduling for large-scale on-demand data broadcasting. In: IEEE INFOCOM, vol. 2, pp. 651–659 (1998)
Bar-Noy, A., Goshi, J., Ladner, R.: Offline and on-line guaranteed start-up delay for media-on-demand with stream merging. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 164–173 (2003)
Chan, W.T., Lam, T.W., Ting, H.F., Wong, W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 210–218. Springer, Heidelberg (2004)
Dan, A., Sitaram, D., Shahabuddin, P.: Scheduling policies for an on-demand video server with batching. In: Proceedings of the ACM Multimedia, pp. 15–23 (1994)
Dykeman, H.D., Ammar, M.H., Wong, J.W.: Scheduling algorithms for videotex systems under broadcast delivery. In: IEEE International Conference on Communications (ICC), pp. 1847–1851 (1986)
Edmonds, J., Pruhs, K.: A maiden analysis of Longest Wait First. In: Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorihtms, pp. 818–827 (2004)
Hawkins, A.T., Mao, W.: On multi-channel data broadcast scheduling. In: The Second Workshop on Intelligent Multimedia Computing and Networking, pp. 915–918 (2002)
Hung, R.Y.S.: Scheduling online batching systems. Master’s thesis, The University of Hong Kong (2005)
Hung, R.Y.S., Ting, H.F.: Scheduling online batching systems: a competitiveness study on patience and sharing. In: Proceedings of the Latin American Theoretical Informatics Symposium, pp. 605–616 (2006)
Jiang, S., Vaidya, N.H.: Scheduling data broadcast to “impatient” users. In: Proceedings of the 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE), pp. 52–59 (1999)
Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. Journal of Scheduling 4(6), 339–354 (2000)
Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 313–324. Springer, Heidelberg (2003)
Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science 325(3), 448–479 (2004)
Mao, W.: Competitive analysis of online algorithm for on-demand data broadcast scheduling. In: Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 292–296 (2000)
Sarhan, N.J., Das, C.R.: A simulation-based analysis of scheduling policies for multimedia servers. In: Proceedings of the 36th Annual Simulations Symposium, pp. 183–190 (2003)
Shachnai, H., Yu, P.: Exploring wait tolerance in effective batching for video-on-demand scheduling. Multimedia Systems 6, 382–394 (1998)
Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 163–174. Springer, Heidelberg (2006)
Wong, J.W.: Broadcast delivery. Proceedings of IEEE 76(12), 1566–1577 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hung, R.Y.S., Ting, H.F. (2006). A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_35
Download citation
DOI: https://doi.org/10.1007/11809678_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)