Abstract
Streaming media service, such as video-on-demand (VOD), is getting popular in network environment. To get high cost/performance ratio, Hierarchical Storage Management (HSM) is adopted by streaming media servers in such services. However, if HSM system places the media object, say a movie, exclusively in a tertiary storage device, the response time to an on demand service will be too long to be satisfactory. This paper presents a new data placement method based on prearrangement strategy in HSM for streaming media server. By prearranging the head part of media objects on disk, streaming data accesses can get immediate response, and in concurrent, tertiary storage device can be prepared for continuous access. The paper discusses a method to calculate the head data length of media objects and an algorithm to read data in HSM. Simulation result shows that with a low disk storage cost, the response time of the HSM system can be reduced to a large extent, and the performance of the whole system is enhanced significantly.
Supported by the National Natural Science Foundation of China under Grant No.60221120146; the National Grand Fundamental Research 973 Program of China under Grant No.G1999032704.
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
Barnett, S.A., Anido, G.J.: A Cost Comparison of Distributed and Centralized Approaches to Video-on-Demand. IEEE Journal on Selected Areas in Communications 14(6), 1173–1183 (1996)
Brubeck, D.W., Rowe, L.A.: Hierarchical storage management in a distributed VOD system. IEEE Multimedia 3(3), 37–47 (1996)
Lin, Y.-D., Lai, H.-Z., Lai, Y.-C.: A hierarchical network storage architecture for video-on-demand services. In: Proceedings 21st IEEE Conference on Local Computer Networks, pp. 355–364 (1996)
Lau, S.W., Liu, J.C.S.: Scheduling and data layout policies for a near-line multimedia storage architecture. Multimedia Systems 5(5), 310–323 (1997)
Shi, J., Xing, C., Zhou, L.: Efficiently Scheduling Taperesident Jobs. In: The 19th IEEE Symposium on Mass Storage Systems, pp. 305–309 (2002)
Christodoulakis, S., Triantafillou, P., Zioga, F.: Principles of optimally placing data in tertiary storage libraries. In: Proc. of Intl. Conf. on Very Large Data Bases, Athens, Greece. pp. 236–245 (1997)
Li, J., Prabhakar, S.: Data Placement for Tertiary Storage. In: The 19th IEEE Symposium on Mass Storage Systems, pp. 193–207 (2002)
Ghandeharizadeh, S., Dashti, A., Shahabi, C.: A pipelining mechanism to minimize the latency time in hierarchical multimedia storage managers. Computer communications 18(3), 170–184 (1995)
Johnson, T., Miller, E.L.: Performance measurements of tertiary storage devices. In: Proc. of 24th Intl. Conf. on Very Large Data Bases, New York, pp. 50–61 (1998)
Daoliang, Y., Xiaoxia, R., Ming, C.: Study on Data Replacement Algorithm in Continuous Media Server with Hierarchical Storage. In: 16th IFIP World Computer Congress, Beijing, vol. 2, pp. 1387–1394 (2000)
Fishwick, P.A.: Simpack: Getting Started with Simulation Programming in C and C++. In: 1992 Winter Simulation Conference, Arlington, VA, pp. 154–162 (1992)
SimPack Toolkit, http://www.cise.ufl.edu/~fishwick/simpack/simpack.html
Buzacott, J.A., Shanthikumar, J.G.: Stochastic Models of Manufacturing Systems. Prentice-Hall, Englewood Cliffs (1993)
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
Xu, Y., Xing, C., Zhou, L. (2003). A Data Placement Method of HSM for Streaming Media Server in Network Environment. In: Bianchi-Berthouze, N. (eds) Databases in Networked Information Systems. DNIS 2003. Lecture Notes in Computer Science, vol 2822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39845-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39845-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20111-3
Online ISBN: 978-3-540-39845-5
eBook Packages: Springer Book Archive