Skip Navigation

The Computer Journal 1997 40(9):529-540; doi:10.1093/comjnl/40.9.529
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lau, S.-W.
Right arrow Articles by Lui, J. C. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Designing a Hierarchical MUltimedia Storage Server

S.-W. Lau1 and J. C. S. Lui1

1 Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong Email: cslui{at}cse.cuhk.edu.hk

Recent advances in computer storage architectures, high-speed networking technologies and compression techniques support a proliferation of multimedia information dissemination via computer networks. For example, applications such as video-on-demand (VOD) and home shopping services are now possible. A major requirement of VOD application is that the VOD storage server has to store and retrieve a huge amount of video data in a continuous manner. Therefore, near-line storage devices, such as robotic tape libraries, have to be employed in VOD storage servers which can contain thousands of large video objects. In this paper, we study in detail the design issues of a hierarchical multimedia storage server that consists of a disk array for caching and a robotic tape library for the storage of all the video objects. We propose and study in detail the file layout policy in the disk subsystem, the scheduling of the tape subsystem, the video object replacement algorithms, the read/write scheduling of the disk subsystem and the memory buffer requirement.

Received October 1, 1996. revised November 12, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.