Failure recovery algorithms for multimedia servers |
| |
Authors: | Prashant J. Shenoy Harrick M. Vin |
| |
Affiliation: | (1) Distributed Multimedia Computing Laboratory, Department of Computer Sciences, University of Texas at Austin, Taylor Hall 2.124, Austin, TX 78712-1188, USA; e-mail: {shenoy,vin}@cs.utexas.edu, Tel.: (512) 471-9732, Fax: (512) 471-8885, http://www.cs.utexas.edu/users/dmcl, US |
| |
Abstract: | In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method exploits the inherent redundancy in video streams (rather than error-correcting codes) to approximately reconstruct data stored on failed disks, the second method exploits the sequentiality of video playback to reduce the overhead of online failure recovery in conventional RAID arrays. For the former approach, we present loss-resilient versions of JPEG and MPEG compression algorithms. We present an inherently redundant array of disks (IRAD) architecture that combines these loss-resilient compression algorithms with techniques for efficient placement of video streams on disk arrays to ensure that on-the-fly recovery does not impose any additional load on the array. Together, they enhance the scalability of multimedia servers by (1) integrating the recovery process with the decompression of video streams, and thereby distributing the reconstruction process across the clients; and (2) supporting graceful degradation in the quality of recovered images with increase in the number of disk failures. We present analytical and experimental results to show that both schemes significantly reduce the failure recovery overhead in a multimedia server. |
| |
Keywords: | :Multimedia storage servers – Redundant disk arrays – RAID – Fault tolerance – Video compression algorithms |
本文献已被 SpringerLink 等数据库收录! |
|