Abstract
In Harmonic windows scheduling (HWS), a data file is divided into N pages and the pages are scheduled in c channels in such a way that each page i appears at least once in some channel in every window of size i. The optimal HWS problem aims to maximize N. Let κ be the largest integer satisfying H κ ≤ c, where H n is the n th harmonic number. Then κ is an upper bound on N, if the HWS framework is used. Thus an optimal HWS schedule wastes “bandwidth” at least c–H κ . Harmonic block windows scheduling (HBWS) generalizes HWS by grouping b consecutive pages into a superpage. Let N be the total number of pages scheduled. The ratio N/b is directly proportional to the maximum initial waiting time in Media-on-Demand applications. We propose a method that starts with a HWS schedule and modifies it to generate a HBWS schedule that achieves a higher ratio N/b. For up to five channels, we demonstrate that we can always achieve N/b >κ. We also prove that as we increase b, N/b approaches the theoretical upper bound.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 433–442 (2002)
Bar-Noy, A., Nisgav, A., Patt-Shamir, B.: Nearly optimal perfectly-periodic schedules. In: Proc. 20th ACM Symp. on Principle of Distributed Computing, pp. 107–116 (2001)
Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Mathematics of Operations Research 27, 518–544 (2002)
Bar-Noy, A., Gosh, J., Ladner, R.E.: Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. In: Proc. 15th ACM Symp. Parallel Algorithms and Atchitectures, pp. 164–173 (2003)
Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-on-demand. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 791–800 (2003)
Engebretsen, L., Sudan, M.: Harmonic broadcasting is optimal. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (2002)
Hua, K.A., Cai, Y., Sheu, S.: Patching: a multicast technique for true video-on-demand services. In: Proc. ACM Multimedia, pp. 191–200 (1998)
Hu, A., Nikolaidis, I., Van Beek, P.: On the design of efficient video-on-demand broadcast schedules. In: Proc. 7th Int’l. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 262–269 (1999)
Juhn, L., Tseng, L.: Harmonic broadcasting protocols for video-ondemand service. IEEE Trans. on Broadcasting 43, 268–271 (1997)
Lin, Z.: Near-Optimal Heuristic Solutions to Truncated Harmonic Windows Scheduling and Harmonic Group Windows Scheduling. M.Sc. Thesis. School of Computing Science. Simon Fraser University (2004)
Ma, F.: Comparison of broadcasting schemes and stream-merging schemes for video-on-demand. CMPT415 Course Project Report (2003)
Pâris, J.-F.: A simple low-bandwidth broadcasting protocol for video-ondemand. In: Proc. 8th Int’l. Conf. on Computer Communications and Networks, pp. 118–123 (1999)
Pâris, J.-F., Carter, S.W., Long, D.D.E.: A low-bandwidth broadcasting protocol for video-on-demand. In: Proc. 7th Int’l. Conf. on Computer Communications and Networks, pp. 690–697 (1998)
Sun, Y., Kameda, T.: Harmonic block windows scheduling for video-on-demand. School of Computing Science, Simon Fraser University. Tech. Rept. 2005-05 (2005), ftp://fas.sfu.ca/pub/cs/TR/2005/CMPT2005-05.pdf (Submitted for publication)
Tseng, Y.-C., Yang, M.-H., Chang, C.-H.: A recursive frequency-splitting scheme for broadcasting hot videos in VOD service. IEEE Trans. on Communications 50, 1348–1355 (2002)
Van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Dordrecht (1987)
Yan, E.M., Kameda, T.: An efficient VOD broadcasting scheme with user bandwidth limit. In: Proc. SPIE/ACM Conf. on Multimedia Computing and Networking, vol. 5019, pp. 200–208 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Y., Kameda, T. (2005). Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling. In: Candan, K.S., Celentano, A. (eds) Advances in Multimedia Information Systems. MIS 2005. Lecture Notes in Computer Science, vol 3665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551898_17
Download citation
DOI: https://doi.org/10.1007/11551898_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28792-6
Online ISBN: 978-3-540-31945-0
eBook Packages: Computer ScienceComputer Science (R0)