A survey of approaches to fault tolerant design of VOD servers: techniques, analysis and comparison
Parallel Computing - Special issues on applications: parallel data servers and applications
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling and Performance Comparison of Reliability Strategies for Distributed Video Servers
IEEE Transactions on Parallel and Distributed Systems
Cost Analyses for VBR Video Servers
IEEE MultiMedia
Pinned demand paging based on the access frequency of video files in video servers
Journal of Systems and Software
| Hi-index | 0.00 |
In this paper we propose storage allocation schemes to minimize the buffer requirements for fault-tolerant video-on-demand (VOD) servers with disk arrays. To guarantee the high reliability of video service, the servers usually adopt parity-encoding techniques in which data blocks and their associated parity block form a parity group. For real-time video service, all the blocks in a parity group are prefetched to cope with disk failure. Buffer overhead incurred by a prefetch can be reduced by decreasing the parity group size, which demands more storage space for parity blocks. Our proposed scheme called round-level parity grouping (RPG) aims at restoring VBR video streams efficiently. Based on RPG we have developed a heuristic algorithm working towards effective buffer management. The experimental results show that our proposed schemes produce near-optimal buffer requirements.