Abstract
We consider the transmission of a movie over a broadcast network to support several viewers who start watching at arbitrary times, after a wait of at most t wait minutes. A recent approach called harmonic broadcasting optimally solves the case of many viewers watching a movie using a constant amount of bandwidth. We consider the more general setting and v changes dynamically. A natural objective is to minimize the amount of resources required to achieve this task. We introduce two natural measures of resource consumption and performance—total bandwidth usage and maximum momentary bandwidth usage—and propose strategies which are optimal for each of them. In particular, we show that an adaptive form of pyramid broadcasting is optimal for both measures simultaneously, up to constant factors. We also show that the maximum throughput for a fixed network bandwidth cannot be obtained by any online strategy.
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
Albanese, A., Blörnet, J., Edmonds, J., Luby, M., Sudan, M.: Priority encoding transmission. IEEE Trans. Inform. Theory 42(6), 1737–1744 (1996)
Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 433–442 (2002)
Carter, S.R., Paris, J.-F., Mohan, S., Long, D.D.E.: A dynamic heuristic broadcasting protocol for video-on-demand. In: Proc. 21st International Conference on Distributed Computing Systems, pp. 657–664 (2001)
Dan, A., Sitaram, D., Shahabuddin, P.: Dynamic batching policies for an on-demand video server. ACM Multimedia Systems 4(3), 112–121 (1996)
Engebretsen, L., Sudan, M.: Harmonic broadcasting is bandwidthoptimal assuming constant bit rate. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 431–432 (2002)
Eager, D.L., Vernon, M.K., Zahorjan, J.: Bandwidth skimming: a technique for cost-effective video-on-demand. In: Proc. IS&T/SPIE Conference on Multimedia Computing and Networking (MMCN), pp. 206–215 (2000)
Eager, D.L., Vernon, M.K., Zahorjan, J.: Minimizing bandwidth requirements for on-demand data delivery. IEEE Transactions on Knowledge and Data Engineering 3(5), 742–757 (2001)
Juhn, L., Tseng, L.: Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting 43(3), 268–271 (1997)
Juhn, L., Tseng, L.: Fast data broadcasting and receiving scheme for popular video service. IEEE Trans. on Broadcasting 44(1), 100–105 (1998)
Mahanti, A., Eager, D.L., Vernon, M.K., Sundaram-Stukel, D.: Scalable on-demand media streaming with packet loss recovery. In: Proc. 2001 ACM Conf. on Applications, Technologies, Architectures and Protocols for Computer Communications (SIGCOMM 2001), pp. 97–108 (2001)
Pâris, J.-F., Carter, S.W., Long, D.D.E.: Efficient broadcasting protocols for video on demand. In: Proc. 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 127–132 (1998)
Pâris, J.-F., Carter, S.W., Long, D.D.E.: A low bandwidth broadcasting protocol for video on demand. In: Proc. 7th International Conference on Computer Communications and Networks, pp. 690–697 (1998)
Viswanathan, S., Imielinski, T.: Metropolitan area video-on-demand service using pyramid broadcasting. Multimedia Systems 4(4), 197–208 (1996)
Wong, J.W.: Broadcast delivery. Proc. of the IEEE 76(12), 1566–1577 (1988)
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
Biedl, T. et al. (2003). Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive