Abstract
Various applications for world-wide multimedia object distribution arise currently as more and more companies integrate streamed continuous media elements in their web pages and as TV broadcasters add computer programs and data to their video streams.Currently, the streams that can be found on the web have only very small data volume, but as network capacities increase, the data volume mat is used by applications will also be increased. TV applications have a lack of networking support and are unable to give feedback to the sender. In the future the integration of computer networks, telephony and broadcast networks will achieve a functional integration of these two worlds.
But as the amount of continuous media data which is offered for everybody to retrieve increases, simple caching mechanisms that work currently well will not be appropriate any more. To address this danger, the introduction of distribution mechanisms which provide more coordination among caches is necessary. As a basis for such a development, we investigate the probability of movies to be requested. This is chosen as a starting point because the current simple caching mechanisms operate very successfully for small-volume data such as text or icons, and high-quality movies are currently the most attractive medium which has the very high requirements in terms of storage as well as bandwidth. In this paper, we review current models on access probabilities and we give strong indication that the current assumptions about hit rates are invalid if the number of users connecting to an individual server differ widely. Since on-demand retrieval of large continuous media streams (especially movies) is currently available only as music CD and movie rental or sale, we take that data as a basis to create a model for access probabilities on this most storage-and bandwidth-demanding multimedia data.
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
Michael Bär, Carsten Griwodz, and Lars C. Wolf. Long-term Movie Popularity Models in Video-on-Demand Systems or The Life of an on-Demand Movie. In Proceedings of the Fifth ACM International Multimedia Conference, Seattle, USA, November 9-13 1997.
Scott A. Bamctt, Gary J. Anido, and H.W. Beadle. Caching Policies in a Distributed Video on-Demand System. In Proc. Australian Telecommunication Networks and Applications Conference, Sydney, 1995.
C. Bernhardt and E. Biersack. The Server Array: A Scalable Video Server Architecture. In High-Speed Networking for Multimedia Applications. Kluwer Academic Publishers, 1996.
Y. S. Chen. Mathematical modelling of empirical laws in computer application: A case study. Comput. Math. Applicat., pages 77–78, October 1992.
Asit Dan and Dinkar Sitaram. Buffer Management Policy for an On-Demand Video Server. RC 19347, IBM Research Division, 1993.
Asit Dan and Dinkar Sitaram. A Generalized Interval Caching Policy for Mixed Interactive and Long Video Workloads. RC 20206 (89404), IBM Research Division, September 1995.
Leana Golubchik, John C. S. Lui, and Richard R. Muntz. Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers. Multimedia Systems, 4:140–155,1996.
Wieland Holfelder. Interactive Remote Recording and Playback of Multicast Videoconferences. In IDMS 97 Conference Proceedings, 1997.
J. D. C. Little. A Proof of the Queueing Formula L=1W. Operations Research, 9:383–387,1961.
T. D. C. Little and D. Venkatesh. Popularity-based Assignment of Movies to Storage Devices in a Video-on-Demand System. ACM Multimedia Systems, 1994.
J.P. Nussbaumer, B.V. Patel, F. Schaffa, and J.P.G. Sterbenz. Networking requirements for interactive video on demand. IEEE Journal on Selected Areas in Communication, 13(5):779–787, 1995.
R. Ramarao and V. Ramamoorthy. Architectural Design of On-Demand Video Delivery Systems: The Spatio-Temporal Storage Allocation Problem. In Proceedings of ICC 91. IEEE, 1991.
W. Tetzlaff, M. Kienzle, and D. Sitaram. A Methodology for Evaluating Storage Systems in Distributed and Hierarchical Video Servers. In COMPCON 94 Conference Proceedings, pages 430–439,1994.
Renu Tewari, Rajat Mukherjee, and Daniel M. Dias. Real-Issues for Clustered Multimedia Servers. Technical Report RC 20108, IBM Research Division, June 1995.
VideoWoche. Entertainment Media Verlag GmbH & Co.oHG, Stahlgruberring 11a, 81829 München
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Griwodz, C., Steinmetz, R. (1999). Life-Cycle Considerations for Wide-Area Distribution of Multimedia Data. In: Danthine, A., Spaniol, O., Effelsberg, W., Ferrari, D. (eds) High-Performance Networks for Multimedia Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5541-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5541-4_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7533-3
Online ISBN: 978-1-4615-5541-4
eBook Packages: Springer Book Archive