Abstract
In realtime multimedia storage servers, it is very important to find the optimal values for the round length and the striping unit size since they have strong relation with the throughput. In getting the optimal values, we should not overlook any factor of multimedia servers since this may produce the wrong values far from the optimal. If we use a wrong value, then we may suffer from 2 or 3 times performance degradation. We present a new scheme which considers all possible factors in multimedia servers such as disk properties, buffer space, the characteristics of multimedia objects, and users’ trends of requesting. Since we do not use simple peak data rate but the maximum segment data rate which is much smaller than the peak data rate, we can use the resources very effectively and still guarantees no starvation and no overflow.
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
Scott A. Barnett and Gary J. Anido. Performability of disk-array-based video servers. ACM Multimedia Systems Journal, 6(1):60–74, January 1998.
S. Berson, S. Ghandeharizadeh, R. Muntz, and X. Ju. Staggered striping in multimedia information systems. In Proc. of ACM SIGMOD, pages 79–90, Minnesota, USA, June 1994.
E. Chang and A. Zakhor. Admission control and data placement for vbr video servers. In Proc. of IEEE Int’l conference on Image Processing, pages 278–282, Austin, June 1994.
E. Chang and A. Zakhor. Cost analysis for vbr video servers. In IS&T/SPIE Int’l Symposium on Electronic Imaging: Science and Technology, pages 29–31, California, January 1996.
J. Dangler, E. Biersack, and C. Bernhart. Deterministic admission control strategies in video servers with variable bit rate. In Proc. of International Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services, pages 164–171, Hiroshima, Japan, June 1996.
J. Gemmell and S. Christodoulakis. Principles of delay-sensitve multimedia data storage and retrieval. ACM Trans. of Information Systems, 10(1):51–90, January 1992.
T. Raymond Ng and Jinhai Yang. An analysis of buffer sharing and prefetching techniques for multimedia systems. ACM Multimedia Systems, 4(2):55–69, April 1996.
B. Ozden, R. Rastogi, and A. Silberschatz. Disk striping in video server environments. In Proc. of IEEE Internation Conference on Multimedia Computing and Systems, pages 580–589, Hiroshima, Japan, June 1996.
Huanxu Pan, Lek Heng Ngoh, and Aurel A. Lazar. A buffer-inventory-based dynamic scheduling algorithm for multimedia-on-demand servers. ACM Multimedia Systems Journal, 6(2):125–136, March 1998.
C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17–28, March 1994.
H. M. Vin, Sriram S. Rao, and Pawan Goyal. Optimizing the placement of multimedia objects on disk arrays. In Proc. of IEEE Internation Conference on Multimedia Computing and Systems, pages 158–165, Washington, USA, May 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, K., Yeom, H.Y. (1998). Deciding Round Length and Striping Unit Size for Multimedia Servers. In: Advances in Multimedia Information Systems. MIS 1998. Lecture Notes in Computer Science, vol 1508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49651-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-49651-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65107-9
Online ISBN: 978-3-540-49651-9
eBook Packages: Springer Book Archive