Performance of a mass storage system for video-on-demand
Journal of Parallel and Distributed Computing - Special issue on multimedia processing and technology
An online video placement policy based on bandwidth to space ratio (BSR)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Continuous Retrieval of Multimedia Data Using Parallelism
IEEE Transactions on Knowledge and Data Engineering
Performance of a storage system for supporting different video types and qualities
IEEE Journal on Selected Areas in Communications
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
&pgr;DTV: a client-based interactive DTV architecture
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 2)
Playback Dispatch and Fault Recovery for a Clustered Video System with Multiple Servers
Multimedia Tools and Applications
Design and Evaluation of a Generic Software Architecture for On-Demand Video Servers
IEEE Transactions on Knowledge and Data Engineering
A Memory Copy Reduction Scheme for Networked Multimedia Service in Linux Kernel
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Journal of Systems and Software
File replication in video on demand services
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Multiquality Data Replication in Multimedia Databases
IEEE Transactions on Knowledge and Data Engineering
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Quality-aware replication of multimedia data
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the disk storage subsystem of a VOD server. Due to different demands for different movie titles, the numbers of concurrent accesses to each movie can differ a lot. We define access profile as the number of concurrent accesses to each movie title that should be supported by a VOD server. The access profile is derived based on the popularity of each movie title and thus serves as a major design goal for the disk storage subsystem. Since some popular (hot) movie titles may be concurrently accessed by hundreds of users and a current high-end magnetic disk array (disk) can only support tens of concurrent accesses, it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. The consequence of replication and striping of hot movie titles is the potential increase on the required number of disk arrays. Therefore, how to replicate, stripe, and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate the problem of the video file allocation over disk arrays, demonstrate that it is a NP-hard problem, and present some heuristic algorithms to find the near-optimal solutions. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays.